Rigid Gorenstein toric Fano varieties arising from directed graphs

A directed edge polytope $\mathcal{A}_G$ is a lattice polytope arising from root system $A_n$ and a finite directed graph $G$. If every directed edge of $G$ belongs to a directed cycle in $G$, then $\mathcal{A}_G$ is terminal and reflexive, that is, one can associate this polytope to a Gorenstein toric Fano variety $X_G$ with terminal singularities. It is shown by Totaro that a toric Fano variety which is smooth in codimension $2$ and $\mathbb{Q}$-factorial in codimension $3$ is rigid. In the present paper, we classify all directed graphs $G$ such that $X_G$ is a toric Fano variety which is smooth in codimension $2$ and $\mathbb{Q}$-factorial in codimension $3$.

1. Introduction 1.1.Directed edge polytopes and symmetric edge polytopes.A lattice polytope is a convex polytope all of whose vertices have integer coordinates.Let G = (V (G), A(G)) be a finite directed graph on the vertex set V (G) = [n] := {1, . . ., n} with the directed edge set A(G).For a directed edge e = (i, j) of G, we define ρ(e) ∈ R n by setting ρ(e) = e i − e j .The directed edge polytope of G, denoted by A G , is the lattice polytope defined as A related polytope is the symmetric edge polytope of G, denoted by P G , and defined as Note that one can define the symmetric edge polytope based on the underlying simple graph of G, denoted by G un , since both directions for each edge contribute to the vertices of P G .Here, G un has an edge {i, j} if and only if (i, j) or (j, i) is a directed edge of G. Directed edge polytopes are first introduced in [17] by Ohsugi and Hibi for a tournament graph G.A directed graph G is called symmetric if both (i, j) and (j, i) ∈ A(G) whenever {i, j} is an edge of G un .Notions of directed edge polytopes and symmetric edge polytopes coincide when G is a symmetric directed graph, i.e., A G = P G .Symmetric edge polytopes are of interest in many fields such as commutative algebra ( [18]), algebraic geometry ( [11]) algebraic combinatorics ( [12,19,20]) and number theory ( [6,15,22]).One of the reasons the symmetric edge polytopes gained much attraction is due to its connection to the Kuramoto model ( [14]), which describes the behavior of interacting oscillators ( [7]).
If one assumes that every directed edge of G belongs to a directed cycle in G, then the origin belongs to the relative interior of A G .In particular, A G is a terminal reflexive polytope [11,Proposition 1.4].We denote X G as the projective toric variety associated to the spanning (or face) fan of A G ⊆ N R ∼ = R n .Then X G is a Gorenstein toric Fano variety with terminal singularities.Gorenstein toric Fano varieties are of interest in algebraic geometry and mirror symmetry ( [3,16]).We assume that the reader is familiar with toric varieties.For an introduction of the toric varieties and the notations, we refer the reader to [8].In particular the letter N ∼ = Z n stands for a lattice and M = Hom Z (N, Z) is its dual lattice.We denote their associated vector spaces as N R := N ⊗ Z R and M R := M ⊗ Z R.
1.2.Deformation theory.Let X be a scheme of finite type over C and let A be an Artinian algebra over C.An infinitesimal deformation of X over A is defined as the following cartesian diagram: X X 0 Spec(A) where π is flat.Let π : X → Spec(A) be another deformation of X over Spec(A).We say that π and π are isomorphic, if there exists a map X → X over Spec(A) inducing the identity on X.Let Def X be a functor such that Def X (A) is the set of deformations of X over Spec(A) modulo isomorphisms.X is called rigid, if the first-order deformation space T 1 X := Def X (C[t]/t 2 ) = 0.This implies that X has no nontrivial infinitesimal deformations.It turns out that the toric varieties arising from graphs recover interesting rigid examples.One of them is the famous rigid singularity which is the cone over the Segre embedding P m × P n in P (m+1)(n+1)−1 except for m = n = 1.Equivalently, this is the affine toric variety arising from the complete bipartite graph K m+1,n+1 .The rigidity of toric varieties associated to undirected graphs has been first studied [5] for complete bipartite graphs with one edge removals.A generalization of this family and a sufficient condition for rigidity have been examined in [21].In the present paper, we will discuss infinitesimal deformations of the Gorenstein toric Fano varieties associated to directed edge polytopes.This connection between three different areas of mathematics gives us the opportunity to present high dimensional concrete examples of rigid Gorenstein toric Fano varieties purely in terms of graphs, which is in general a hard computational problem (see Section 5).1.3.Smooth toric Fano varieties arising from directed graphs.For toric Fano varieties, a sufficient condition for their rigidity is known.In fact, Q-factorial toric Fano varieties with terminal singularities, in particular, smooth toric Fano varieties are rigid [10,Theorem 1.4], [4,Theorem 3.2].In [11], Higashitani classified directed graphs G such that X G is Q-factorial.All undefined terms are specified in the sections below.
Theorem 1.1 ([11, Theorem 2.2]).Let G be a finite directed graph such that every directed edge belongs to a directed cycle in G. Then the following arguments are equivalent: for all 1 ≤ a, b ≤ l, where e j is (i j , i j+1 ) or (i j+1 , i j ) for 1 ≤ j ≤ l with i l+1 = i i .
In particular, X G is rigid.
For symmetric directed graphs, i.e., for symmetric edge polytopes, one obtains the following.

Corollary 1.2 ([11, Corollary 2.2]
).Let G be a finite symmetric directed graph.Then the following arguments are equivalent: (3) G un has no even cycle as subgraphs.
In particular, X G is rigid.
1.4.Rigid Gorenstein toric Fano varieties arising from directed graphs.The most general rigidity theorem for toric Fano varieties known to this date is the following result of Totaro: Theorem 1.3.[24, Theorem 5.1] A toric Fano variety which is smooth in codimension 2 and Q-factorial in codimension 3 is rigid.
Combinatorially one can interpret this result in terms of the associated Fano polytope.The toric Fano variety X P is smooth in codimension 2 if and only if the edges of P has lattice length 1 and they are contained in a hyperplane of height 1 with respect to the origin.The Q-factorial in codimension 3 means that the two dimensional faces of P are all triangles.
In the present paper, we classify all directed graphs G such that X G is a Gorenstein toric Fano variety which is smooth in codimension 2 and Q-factorial in codimension 3. Note that since A G is reflexive and terminal, X G is smooth in codimension 2. The following is the main theorem of the present paper.
Theorem 1.4.Let G be a finite directed graph such that every directed edge of G belongs to a directed cycle in G. Then the following arguments are equivalent: (1) X G is smooth in codimension 2 and Q-factorial in codimension 3; (2) G satisfies both of the following: • G has no directed subgraph C 1 whose directed edge set is • For any directed subgraph C 2 of G whose directed edge set is it follows that (i 1 , i 3 ) is a directed edge of G or there exists a vertex j / ∈ {i 2 , i 4 } in G such that (i 1 , j) and (j, i 3 ) are directed edges of G.
In this case, X G is rigid.
For symmetric directed graphs, i.e., for symmetric edge polytopes, we obtain the following.
Corollary 1.5.Let G be a finite symmetric directed graph.Then the following arguments are equivalent: (1) X G is smooth in codimension 2 and Q-factorial in codimension 3; (2) G un has no 4-cycle as a subgraph.
In this case, X G is rigid.
The paper is organized as follows: In Section 2, we recall a connection between lattice polytopes and toric Fano varieties.In Section 3, we present certain characterization of faces of directed edge polytopes.The proof of Theorem 1.4 will be given in Section 4. Finally, we give some examples of Gorenstein toric Fano varieties which are not Q-factorial but rigid, and concluding remarks.

Fano polytopes
In this section, we recall a connection between lattice polytopes and toric Fano varieties.Let P ⊂ R n be a full-dimensional lattice polytope.
• We say that P is a Fano if the origin of R n belongs to the interior of P and the vertices of P are primitive lattice points in Z n .• A Fano polytope P is called terminal if every lattice point on the boundary is a vertex.• A Fano polytope P is said to be reflexive if each facet of P has lattice distance one from the origin.Equivalently, its dual polytope We recall algebro-geometric interpretations of these polytopes.For a Fano polytope P, denote X P the normal toric variety associated to the spanning fan of P. Then X P is a toric Fano variety.Conversely, every toric Fano variety arises in this way from a Fano polytope (see [8, §8.3]).
• A Fano polytope P is terminal if and only if X P has at worst terminal singularities.
• A Fano polytope P is reflexive if and only if X P is Gorenstein.
• A Fano polytope P is Q-factorial if and only if X P is Q-factorial.
• A Fano polytope P is smooth if and only if X P is smooth.
Two lattice polytopes P ⊂ R n and Q ⊂ R m are said to be unimodularly equivalent, denoted by P ∼ = Q, if there exists an affine map from the affine span aff(P) of P to the affine span aff(Q) of Q that maps Z n ∩ aff(P) bijectively onto Z m ∩ aff(Q) and maps P to Q.Each lattice polytope is unimodularly equivalent to a full-dimensional lattice polytope.We say that a lattice polytope is Fano, terminal, reflexive, Q-factorial, smooth if it contains the origin in the interior and it is unimodularly equivalent to a full-dimensional Fano, terminal, reflexive, Q-factorial, smooth polytope, respectively.The authors of [15] classified all graphs whose directed edge polytopes are Fano.(1) A G is Fano; (2) A G is terminal reflexive; (3) Every directed edge of G belongs to a directed cycle in G.
In this case, X G is a Gorenstein toric Fano variety with terminal singularities.
Given two Fano polytopes P ⊂ R n and Q ⊂ R m , set We call P ⊕ Q the free sum of P and Q.Then one has X P⊕Q ∼ = X P × X Q .In particular, P ⊕ Q is smooth if and only if both P and Q are smooth.Thus, if G is not connected, we have the following result by definition.
Proposition 2.2.Let G be a finite directed graph with connected components G 1 , . . ., G r such that A G is terminal and reflexive.Then one has In particular, we obtain We have the following combinatorial criterion for rigidity of terminal and reflexive polytopes.
Proposition 2.3.Let P be a terminal reflexive polytope.If all 2-faces of P are triangles, then X P is rigid.
Proof.By Theorem 1.3, a toric Fano variety which is smooth in codimension 2 and Q-factorial in codimension 3 is rigid.Since P is terminal and reflexive, each edge of P has lattice length 1 and is contained in some hyperplane which has height 1 with respect to the origin.It follows that for rigidity it is enough to have triangle 2-faces, which is equivalent to say that X P is smooth in codimension 3.
The reason that we only consider connected graphs for 2-faces is explained with the following result.
Proposition 2.4.Let P and Q be terminal reflexive polytopes.If all 2-faces of P and Q are triangles, all 2-faces of P ⊕ Q are also triangles.In this case, X P⊕Q is rigid.
Proof.This follows from the fact that faces of P ⊕ Q are convex hulls of faces of P and Q and the fact that P ⊕ Q is a terminal reflexive polytope.

Faces of directed edge polytopes
In this section, we discuss faces of terminal reflexive directed edge polytopes.Let G be a connected finite directed graph on the vertex set [n] and the directed edge set A(G).We assume that every directed edge of G belongs to a directed cycle in G, i.
the origin also belongs to A H .However, this contradicts that the origin belongs to the relative interior of A G and A H is a proper face of A G .Therefore, H is acyclic.
In what follows, we see that a cycle of G determines a proper face of A G .We first introduce some terminology and notation to state this fact.For a directed edge e = (i, j) of G, denote e un the undirected edge {i, j} of G un .A sequence Γ = {e 1 , . . ., e l } of directed edges of G is called a cycle if {e un 1 , . . ., e un l } forms a cycle in G un .Let Γ = (e 1 , . . ., e l ) be a cycle in G such that e un j = {i j , i j+1 } for each j, where i l+1 = i 1 .Then we define ∆ + Γ = {e j ∈ {e 1 , . . ., e l } : We note that the two directed edges (i, j) and (j, i) form a non-homogeneous cycle of length two, although they do not form a cycle in G un .Example 3.2.Let G be the directed graph given in Figure 1.Consider the cycles Γ 1 = {i 1 , i 2 , i 5 , i 6 } and Γ 2 = {i 2 , i 3 , i 4 , i 5 }.Then Γ 1 is a homogeneous cycle whereas Γ 2 is not because

Figure 1
Assume that G has a homogeneous cycle Γ on the vertices {i 1 , . . ., i l }.Then there exists a unique function For two distinct vertices i and j of G, the distance from i to j, denoted by dist G (i, j), is the length of the shortest directed path in G from i to j.If there exists no directed path from i to j, then the distance from i to j is defined to be infinity.The following result defines a face and its supporting hyperplane of A G containing a homogenous cycle.
).Let G be a connected finite directed graph on the vertex set [n] such that A G is terminal and reflexive.Assume that there exists a homogeneous cycle Γ = (e 1 , . . ., e l ) of G such that for all 1 ≤ a, b ≤ l, where e un j = {i j , i j+1 } for 1 ≤ j ≤ l with i l+1 = i 1 .Let H ⊂ R n be the hyperplane defined by the equation Then H is a supporting hyperplane of A G and the proper face F = A G ∩ H contains ρ(e 1 ), . . ., ρ(e l ).
For a finite acyclic directed graph D = ([n], A(D)), we define a lattice polytope A D by Let A D 1 , . . ., A Dr be the facets of A G with acyclic directed graphs D 1 , . . ., D r .Since the origin of R n belongs to the interior of A G , the directed edge polytope A G is divided by A D 1 , . . ., A Dr .In particular, each face of A D i which does not contain the origin is a face of A D i , hence a face of A G .We recall a combinatorial description of the faces of A D from [23].
In other words, the net length of p is the difference between the number of "correctly" oriented edges and the number of "incorrectly" oriented edges in p. Definition 3.7 (path consistent).Let H be a finite acyclic directed graph with n vertices.We say H is path consistent if, for any pair i, j ∈ [n] and two undirected paths p un and q un in H un connecting i to j, we have net(p) = net(q), where p and q are the subsets of A(H) whose underlying undirected graphs are the paths p un and q un in H un .
Note that H is path consistent, if the difference between the number of correctly oriented edges and the number of incorrectly oriented edges in any path depends only on i and j.
Remark 3.8.The homogeneous cycles are path consistent by definition.
Example 3.9.Consider the following finite directed acyclic graph C 1 given in Figure 4. Consider the paths between the vertices i 1 and i 4 .The first path has only one directed edge (i 1 , i 4 ) which has one correctly oriented edge and no incorrectly oriented edges.The second path consists of the directed edges (i 1 , i 2 ), (i 3 , i 2 ), (i 3 , i 4 ) such that the two edges (i 1 , i 2 ), (i 3 , i 4 ) are correctly oriented whereas (i 3 , i 2 ) is incorrectly oriented.Definition 3.10.Let H be a path consistent graph such that H un is connected.For any two vertices u, v ∈ V (H), pick any undirected path p un connecting u to v and define uv = net(p) where p is a subset of A(H) whose underlying undirected graph is p un in H un .Note that uv is well-defined because H is path consistent.Moreover, a weight source always exists but it not necessarily unique.As we shall see in Proposition 3.12, the choice of a weight source does not matter.Definition 3.11.Let H be a path consistent graph such that H un is connected.Let u * be a weight source.The weight function (with respect to u * ) of H is defined as Proposition 3.12 ([23, Proposition 3.13]).Let H be a path consistent graph and H un be connected.Let ω u * be the weight function of H with respect to u * .Then: (1) The equality ω u * (i) = ω u * (j) − 1 holds for each directed edge (i, j) ∈ A(H).
(2) ω u * (i) ≥ 0 for all i ∈ V (H).The equality holds if and only if i is a weight source. ( Definition 3.14.Let D = (V (D), A(D)) be a finite acyclic directed graph and H ⊂ D a directed subgraph of D with V (H) = V (D) and the directed edge set A(H).Assume that H is path consistent.Each directed edge e = (H un i , H un j ) ∈ A(H comp ) corresponds to a unique directed edge (v i , v j ) ∈ A(D) \ A(H).We define the weight decrease of e to be the quantity wd(e) := ω(v i ) − ω(v j ).Assume that H is path consistent.We say that H is admissible (with respect to D) if, for every directed cycle C in H comp , the condition  Let H 1 be the homogeneous cycle on the vertices i 1 , i 2 , i 3 , i 4 , H 2 be the single directed edge (i 5 , i 6 ), and H 3 be the single vertex i 7 where H un i is the underlying undirected graph of H i for i ∈ [3].As a weight source, one may choose i 1 or i 3 in H 1 , i 5 in H 2 and i 7 in H 3 .Then, by Proposition 3.12, values of the weight function is given as Then the multi-graph H comp is given as in Figure 6.
then A G has a square 2-face.
Proof.The cycle C 1 = {(i 1 , i 2 ), (i 3 , i 2 ), (i 3 , i 4 ), (i 1 , i 4 )} of G is homogeneous.Then one has Let H ⊂ R d be the hyperplane defined by the equation 3, where Note that by the definition of H, (i 1 , i 3 ), (i 3 , i 1 ), (i 2 , i 4 ), (i 4 , i 2 ) are not directed edges of D. Therefore, H is admissible with respect to D. Thus, A H is a face of A D from Theorem 3.17.In particular, A H is a face of A G .Since A H is a square, A G has a square 2-face.

Our goal is to show that
Next, we consider the case that G has a directed subgraph C 2 .Lemma 4.2.Let G be a connected directed graph such that A G is terminal and reflexive.Assume that G has a directed subgraph C 2 whose directed edge set is is not a directed edge of G and there does not exist a vertex j with j / ∈ {i 2 , i 4 } in G such that (i 1 , j) and (j, i 3 ) are directed edge of G, then A G has a square 2-face.

Proof. The cycle
Let H ⊂ R d be the hyperplane defined by the equation a Similarly to the Proof of Lemma 4.1, we define Note that by the definition H, (i 1 , i 3 ), (i 3 , i 1 ), (i 2 , i 4 ), (i 4 , i 2 ) are not directed edges of D. Then C 2 is path consistent.Now, we define the path consistent subgraph H of D on the vertex set V (D) and the directed edge set A(C 2 ), namely, H has |V (D)| − 4 isolated vertices.Let H un 1 be a connected component of H un whose edge set is {(i 1 , i 2 ), (i 2 , i 3 ), (i 4 , i 3 ), (i and the corresponding isolated vertices as weight sources of remaining subgraphs of H, we obtain the weight function of H as Hence, for any directed edge e of H comp , one has −2 ≤ wd(e) ≤ 2. In particular, for a directed edge e = (H un i , H un j ) of H comp corresponding to a directed edge (v i , v j ) ∈ A(D) \ A(H), one has wd(e) = −2 if and only if v j = i 3 and Thus, for any directed cycle C in H comp , there is at most one directed edge e in C such that wd(e) < 0. Suppose that there exists a directed cycle C in H comp such that e∈C wd(e) ≤ −|C|.
Then we may assume the extreme cycle case C = (e 1 , e 2 ) with wd(e 1 ) = −2 and wd(e 2 )=0.This implies that there exists a vertex j with j = i 2 , i 4 in G such that (i 1 , j) and (j, i 3 ) are directed edge of G, a contradiction.Therefore, H is admissible with respect to D. Thus, we conclude that A H is a square 2-face of A D from Theorem 3.17 and hence of A G .
Finally, we see the case where A G has a non-triangle 2-face.Lemma 4.3.Let G be a connected directed graph such that A G is terminal and reflexive.If A G has a non-triangle 2-face, then G satisfies one of the following: • G has a directed subgraph C 1 whose directed edge set is {(i 1 , i 2 ), (i 1 , i 4 ), (i 3 , i 2 ), (i 3 , i 4 )}; • There exists a directed subgraph C 2 of G whose directed edge set is such that (i 1 , i 3 ) is not a directed edge of G and there does not exist a vertex j in G such that (i 1 , j) and (j, i 3 ) are directed edge of G. Suppose that G does not have C 1 as a subgraph.Then we can assume that G has C 2 as a subgraph such that A C 2 is a face of A G .If (i 1 , i 3 ) is a directed edge of G, then A C 2 is not a face of A G .In fact, the open line segment between the origin and the lattice point ρ((i 1 , i 3 )) intersects A C 2 .Since the origin belongs to the relative interior of A G , this implies that A C 2 intersects the relative interior of A G .This contradicts that A C 2 is a proper face of A G .Hence (i 1 , i 3 ) is not a directed edge of G.
In the last part of the proof, we will show that there exists no j in V (G) \ {i 2 , i 4 } such that (i 1 , j) and (j, i 3 ) are directed edges of G. On the contrary, suppose that there exists such a vertex j ∈ V (G) \ {i 2 , i 4 }.Let j 1 , . . ., j k ∈ V (G) \ {i 2 , i 4 } be the vertices of G such that for any 1 ≤ l ≤ k, (i 1 , j l ) and (j l , i 3 ) are directed edges of G. Let G be the subgraph of G whose directed edge set is Observe that G is path consistent.We show that A G is face of A G .Set n = |V (G)| and A = V (G) \ {i 1 , i 2 , i 3 , i 4 , j 1 , . . ., j k }.Let H ⊂ R n be the hyperplane defined by the equation a 1 x 1 + • • • + a n x n = 1 and H + ⊂ R n the closed half-space defined by the inequality Here, for l ∈ A, one has a l = 0 if there is no v with dist G (v, l) < ∞.Then we notice that for l ∈ A, one has (4.1) where a l = min({a v + dist G (l, v) : v ∈ V (G) \ A} ∪ {0}).In fact, if a l > a l , then there are However, since (i In this part, we observe that A G is a face of A G .First, we see that H is a supporting hyperplane of A G .Since A G ⊂ H, it is enough to show A G ⊂ H + .Let e = (i, j) be a directed edge of G.When i ∈ V (G) \ A and j ∈ A, one has that a j ≥ max{a i − 1, 0} by the definition of a j .Hence a i − a j ≤ 1.This implies ρ(e) ∈ H + .For any l ∈ A, one has a l = 0 or 1.If i ∈ A, then a i − a j ≤ 1 for any j ∈ V (G).This implies ρ(e) ∈ H + .Therefore, A G ⊂ H + .Thus H is a supporting hyperplane of A G and the proper face Recall from Lemma 3.1 that every proper face of A G is the directed edge polytope of a finite acyclic directed graph.Let D be a finite acyclic directed graph such that F = A D .Since F contains A G , G is a subgraph of D. On the other hand, it is easy to see that (i 1 , i 3 ), (i 3 , i 1 ), (i 2 , i 4 ), (i 4 , i 2 ) and (i 2 , j l ), (i 4 , j l ), (j l , i 2 ), (j l , i 4 ) are not directed edges of D for any l = 1, . . ., k.We show that A G is a face of A D .Since the origin belongs to the relative interior of A G , it is enough to show that A G is a face of A D .
Let H be a subgraph of D on the vertex set V (D) and the directed edge set A(G ), namely, Hence for any directed cycle C in H comp , there is at most one directed edge e in C such that wd(e) < 0. Suppose that there exists a directed cycle C in H comp such that e∈C wd(e) ≤ −|C|.
Then we can assume that C = (e 1 , e 2 ) and wd(e 1 ) = −2 and wd(e 2 )=0.This implies that there exists a vertex j with j / ∈ {i 2 , i 4 , j 1 , . . ., j k } in G such that (i 1 , j) and (j, i 3 ) are directed edge of G.However, there is no such j except for {j 1 , . . ., j k }, a contradiction.Therefore, H is admissible with respect to D. Thus, A H is a face of A D from Theorem 3.17.In particular, A H is a face of A G .On the other hand, A C 2 is not a face of A G .Indeed, C 2 is not admissible with respect to G .This contradicts the fact that for any two proper faces F 1 and F 2 of a convex polytope, F 1 ∩ F 2 is a face of both F 1 and F 2 .Because one can let This concludes the sufficient and necessary conditions where A G has a non-triangle (square) 2-face and the proof of Theorem 1.4.A simple argument proves Corollary 1.5 as follows.
Proof.(Corollary 1.5)If X G is smooth in codimension 2 and Q-factorial in codimension 3, then the fact that G has no directed subgraph C 1 implies that G does not have a 4-cycle.On the other hand, if G un has no 4-cycles, then G does not have C 1 nor C 2 .

Examples and concluding remarks
In this section we present two different families of directed graphs such that their associated Gorenstein toric Fano variety is not Q-factorial (equivalently smooth by [11, Theorem 2.2]) but rigid.Recall that we consider connected directed graphs such that every directed edge belongs to a directed cycle.We conclude this section with some remarks about the calculation of T 1 X G when A G a square 2-face.Proposition 5.1.Let G 2k be a symmetric directed graph with k ≥ 2 such that G un 2k is a 2k-cycle.Then dim(P G 2k ) = 2k − 1 and every (2k − 3)-faces of P G 2k is a simplex.Hence Proof.This follows from [9,Proposition 4.3].This proposition presents a family of directed graphs G such that X G is rigid and Q-factorial in higher codimension.Higashitani gave a characterization of all directed graphs whose associated Gorenstein toric Fano varieties are Q-factorial.On the other hand, Theorem 1.4 is a characterization of all directed graphs whose associated Gorenstein toric Fano varieties are Q-factorial in codimension 3. Then the following problem naturally occurs.Problem 5.2.For any positive integer k ≥ 4, characterize all directed graphs whose associated Gorenstein toric Fano varieties are Q-factorial in codimension k.
Next, we introduce another family of non-smooth rigid Gorenstein toric Fano varieties.Proposition 5.3.Let G be a connected directed graph without multiple edges constructed by gluing directed 2k-cycle and 2l-cycle along any number of edges.Then X G is rigid.
Proof.If k ≥ 3 or l ≥ 3, it suffices to consider the case k = 2 and l ≥ 3. Then the two even cycles can be glued along one, two or three edges.In all cases, G has no directed subgraph C 1 and C 2 .If k = l = 2, then the only case where G contains C 2 (or C 2 ) is the case where we glue the cycles along two edges.By Theorem 1.4, since there exists a vertex j with satisfied property, X G is rigid.
The investigation of the necessary condition for rigidity of X G is more challenging.If the directed edge polytope A G has a square 2-face characterized as in Section 4, one can consult the comparison theorems of Kleppe in [13, Theorem 3.9] to relate T 1 X P to the degree zero part of T 1 cone(X P ) .Namely one obtains the following isomorphism T 1 X P ∼ = (T 1 cone(X P ) ) 0 .Here cone(X P ) is the cone over X P and is an affine Gorenstein toric variety.We consider the associated cone to this affine toric variety as cone((A G ), 1)) ⊆ N R ⊕ R ∼ = R n+1 .The first-order deformations of affine (Gorenstein) toric varieties has been studied by Altmann and it is known that T 1 admits an M -grading [1,Theorem 2.3].The degree zero part means that we consider the multidegrees R ∈ M × {0} ∼ = Z n+1 .Any Q-Gorenstein affine toric variety smooth in codimension 2 and Q-factorial in codimension 3 is rigid [2, Corollary 6.5.1].Moreover by [2, Corollary 6.5], the existence of a non-triangle 2-face implies that dim(T 1 cone(X G ) ) = ∞ for dim(A G ) ≥ 3.However, this fact does not directly guarantee the existence of a degree zero component as explained in [21,Proposition 3.9] for dim(A G ) ≥ 4. In particular for dim(A G ) = 3, since A G is reflexive, one obtains a non-zero homogenous component of T 1 cone(X G ) for the multidegree (m, 0) where m ∈ M ∼ = R n is defining the affine supporting hyperplane of the square 2-facet.This computation can be done by following the combinatorial recipes presented in [1,2] which we do not present in detail here.In general, this question is not trivial and needs to be explored.In the perspective of this paper, this is a computational open question which would conclude the classification of all directed graphs G such that X G is rigid.

Definition 3 . 4 .
Let D = (V (D), A(D)) be a finite acyclic directed graph and H ⊂ D directed subgraph of D with V (H) = V (D) and the directed edge set A(H).Let H un 1 , . . ., H un m be the connected components of the underlying undirected graph H un of H.Here H may have isolated vertices and we regard them as connected components of H un .The directed multi-graph H comp is the graph with vertex set

Figure 3 .
Figure 3. H comp There is a loop at vertex H un 1 since (i 1 , i 3 ) ∈ A(D) \ A(H) where i 1 , i 3 ∈ H 1 .Additionally, H comp has two edges (H un 1 , H un 2 ) and (H un 3 , H un 2 ) because (i 3 , i 5 ) ∈ A(D)\A(H) where i 3 ∈ H 1 and i 5 ∈ H 2 , and (i 6 , i 5 ) ∈ A(D) \ A(H) where i 6 ∈ H 3 and i 5 ∈ H 2 .Definition 3.6.Let H be a finite acyclic directed graph with n vertices.For a pair of vertices i, j ∈ [n], consider an undirected path p un in H un connecting i to j.Let i = i 1 , i 2 , . . ., i k = j be vertices of p un (in order) where {i 1 , . . ., i k } ⊆ [n].Let p be a subset of A(H) whose underlying undirected graph is p un .We define the net length of p as net(p) = |{(i l , i l+1 ) ∈ p : l ∈ [k]}| − |{(i l+1 , i l ) ∈ p : l ∈ [k]}|.

Definition 3 .
15 (admissible).Let D = (V (D), A(D)) be a finite acyclic directed graph and H ⊂ D a directed subgraph of D with V (H) = V (D) and the directed edge set A(H).

16 .
Consider the graph D given in Figure5.Let H be a directed subgraph of D given with the blue vertices and directed edges.Then H un has three connected components H un 1 , H un 2 and H un 3 .As in Example 3.9 one can show that H is path consistent.

Proof.
First we classify acyclic directed graphs D such that dim(A D ) = 2. Let D be an acyclic directed graph with d vertices without isolated vertices such that dim(A D ) = 2 and let D 1 , . . ., D r be its connected components.Then d ≥ 3 and H has at least 3 edges.Since the rank of the incidence matrix of the directed graph D is d−r, we have d−r−1 ≤ dim(A D ) = 2, hence, d ≤ r + 3. Since D has no isolated vertices, each connected component has at least two vertices.Hence one has d ≥ 2r.Therefore, we obtain 2r ≤ d ≤ r + 3.This implies that r ≤ 3 and 3 ≤ d ≤ 6.If r = 1, namely, D is connected, then d = 3 or d = 4. Since dim(A D ) = 2, D is one of a path of length 3, a 3-cycle, a 4-cycle, and a (1, 3)-complete bipartite graph with some orientation.If r = 2, then d = 4 or d = 5.In this case, D is a disjoint union of one edge and a path of length 2 with some orientation.If r = 3, then d = 6.In this case, D is a disjoint union of 3 edges with some orientation.By a routine calculation, it follows that if D = C 1 or D = C 2 , then A D is a square, otherwise, A D is a triangle.Hence G has C 1 or C 2 as subgraphs.

and H un 2 ,
. . ., H un m−3−k be the other connected components of H un , where m = |V (D)|.Note that H un 2 , . . ., H un m−3−k are isolated vertices of H un .Then we have

Example 5 . 4 .
Let us consider the four dimensional symmetric edge polytope P G of the graph G as in the Figure7.

Figure 7 .
Figure 7. Graph G e.A G is terminal and reflexive by Proposition 2.1.First, we show that each proper face of A G is the directed edge polytope of a finite acyclic directed graph.Here a finite directed graph is called acyclic if it has no directed cycles.It is clear that each proper face of A G is the directed edge polytope A H of a directed subgraph H of G.If H is not acyclic, then there exists a directed cycle (i 1 , i 2 ), (i 2 , i 3 ), . . ., (i r , i 1 ) of H. Hence e i 1 − e i 2 , e i 2 − e i 3 , . . ., e ir − e i 1 belong to A Lemma 3.1.LetG be a connected finite directed graph such that A G is terminal and reflexive.Then each proper face of the directed edge polytope A G is the directed edge polytope of a finite acyclic directed subgraph H of G.Proof.H . Then since 1 r ((e i 1 − e i 2 ) + (e i 2 − e un k are the connected components of H un .Let H 1 , . . ., H k be directed subgraphs of H such that • A(H) is the disjoint union of A(H 1 ), . . ., A(H k ), and • underlying undirected graph of H j is H un j for each j ∈ [k].The weight function of H is the function ω : V (H) → Z obtained by gluing the weight functions ω j ) If u * is another weight source then ω u * = ω u * .Thus the weight function of H is well-defined, i.e. independent of weight source.Definition 3.13.Let H be a path consistent graph such that H un 1 , . . .H are associated to the edges (i 3 , i 5 ), (i 6 , i 7 ), (i 5 , i 7 ), (i 7 , i 2 ) in A(D) \ A(H), respectively.Let C 1 be directed cycle with the edges e 1 , e 2 , e 4 .Then wd(e 1 ) + wd(e 2 ) + wd(e 4 ) = 0 > −3 satisfying condition 3.1.Similarly, one can check that the remaining directed cycle satisfies condition 3.1, as well.Thus H is admissible with respect to D. Then the polytope A H is a face of A D if and only if H is path consistent and admissible.In this section, we prove Theorem 1.4.By Proposition 2.3, it suffices to characterize the graphs G where A G has only triangle 2-faces.First, we consider the case that G has the directed subgraph C 1 .
3 , e 4 where e 1 , e 2 , e 3 , e 4 Lemma 4.1.Let G be a connected directed graph such that A G is terminal and reflexive.If G has a directed subgraph C 1 whose directed edge set is H be a subgraph of D on the vertex set V (D) and the directed edge set A(C 1 ) with |V (D)| − 4 isolated vertices.Recall from Example 3.9 that C 1 is path consistent and it implies that H is path consistent as well.It remains to show that H is admissible with respect to F. Let H un 1 be a connected component of H un whose edge set is {{i and the corresponding isolated vertices as weight sources of remaining subgraphs of H, we obtain the weight function of H asω(i) = 1 : i ∈ {i 2 , i 4 }, 0 : otherwise.Hence for any directed edge e of H comp , one has −1 ≤ wd(e) ≤ 1.In particular, for a directed edge e = (H un i , H un j ) of H comp corresponding to a directed edge (v i , v j ) ∈ A(D) \ A(H), one has wd(e) = −1 if and only if v j ∈ {i 2 , i 4 }.Hence for any directed cycle C in H comp , there is at most one directed edge e in C such that wd(e) < 0. This implies that for every directed cycle C in H comp , one has 1 , i 2 }, {i 2 , i 3 }, {i 3 , i 4 }, {i 4 , i 1 }} and H un 2 , . . ., H un m−3 be the other connected components of H un where m = |V (D)|.Note that H un 2 , . . ., H un m−3 are isolated vertices of H un .By choosing i 1 as a weight source of C 1