Smoothness in Binomial Edge Ideals

Abstract: In this paper we study some geometric properties of the algebraic set associated to the binomial edge ideal of a graph. We study the singularity and smoothness of the algebraic set associated to the binomial edge ideal of a graph. Some of these algebraic sets are irreducible and some of them are reducible. If every irreducible component of the algebraic set is smooth we call the graph an edge smooth graph, otherwise it is called an edge singular graph. We show that complete graphs are edge smooth and introduce two conditions such that the graph G is edge singular if and only if it satisfies these conditions. Then, it is shown that cycles and most of trees are edge singular. In addition, it is proved that complete bipartite graphs are edge smooth.


Introduction
There are several natural ways to associate an ideal to a graph.Let K be a field and G a graph on the vertex set [n] = {1, 2, . . ., n}.The monomial edge ideal of G, I G , in K[x 1 , . . ., x n ] is the ideal generated by the monomials x i x j , where {i, j} is an edge of G.These ideals were first introduced by Villarreal in [1], where he studied the Cohen-Macaulay property of such graphs.Many authors have studied the algebraic properties of these ideals in terms of the underlying graphs, especially their Cohen-Macaulay property.In 2010, Binomial edge ideals were introduced by Herzog, Hibi, Hreinsdóttir, Kahle and Rauh in [2].They appear independently, and at about the same time, also in the paper [3].Let S = K[x 1 , . . ., x n , y 1 , . . ., y n ] be the polynomial ring in 2n variables.For each edge e = {i, j} of G we associate to e a binomial f e defined by f e = f ij = x i y j − x j y i with i < j.The ideal generated by the set of all f e with e ∈ E(G) is called binomial edge ideal.
Observe that a binomial edge ideal can be viewed as an ideal generated by a set of 2-minors of the 2 × n-matrix of indeterminates x 1 , . . ., x n , y 1 , . . ., y n .Indeed, the ideal of 2-minors of the 2 × n-matrix may be interpreted as the binomial edge ideal of a complete graph on [n].Algebraic properties of those ideals in terms of properties of the underlying graphs have been studied by many authors, and further studies are in progress.Related to binomial edge ideals are the ideals of adjacent minors considered by Hoşten and Sullivant [4].In the case of a line graph the binomial edge ideal may be interpreted as an ideal of adjacent minors.This particular class of binomial edge ideals has also been considered by Diaconis, Eisenbud and Sturmfels in [5] where they compute the primary decomposition of this ideal.
It is said that a graph G on [n] is closed with respect to the given labeling of vertices, if G satisfies condition (2) of the following theorem ([2], Theorem 1.1): Theorem 1.Let G be a simple graph on the vertex set [n], and let < be the lexicographic order on S = K[x 1 , . . ., x n , y 1 , . . ., y n ] induced by Then the following conditions are equivalent: 1.The generators f ij of J G form a quadratic Groebner basis; 2. For all edges {i, j} and {k, l} with i < j and k < l one has {j, l} ∈ E(G) if i = k, and {i, k} ∈ E(G) if j = l.Now let I be an ideal in K[x 1 , . . ., x n ], where K is algebraically closed.By Z(I) we mean, the algebraic set associated to I, the set of all points, a = (a 1 , . . ., a n ) in K n such that for each f in I, f (a 1 , . . ., a n ) = 0.When I is a monomial ideal we can see I as intersection of some pure monomial ideals, i.e., the ideals generated by some of x α i i ; i = 1, . . ., n and α i ∈ IN.The minimal associated primes of I are of the form < x i 1 , . . ., x i r >, with {i 1 , . . ., i r } ⊂ [n] and Z(I) = Z( √ I) = P∈Min(I) Z(P) where Min(I) is the set of the minimal prime ideals of I. From the geometric point of view, which have no complicated geometric structure.In contrast to monomial edge ideals, binomial edge ideals have many interesting geometric properties.The purpose of this paper is a initial study of geometric properties of binomial edge ideals and the first geometric property of an algebraic set is the smoothness or the locus of singularity.
Let Y ⊂ K n be an affine variety, and let where r is the dimension of Y. Y is nonsingular if it is nonsingular at every point.Otherwise, Y is called singular.Let I be an ideal in A and Z(I) be the algebraic set associated to I. We have Z(I) = Z( √ I) = P∈Min(I) Z(P) where each Z(P) is an affine variety.It is said y ∈ K n is a singular point of Z(I) when there exists P ∈ Min(I) such that y is a singular point of Z(P).
In this paper we prove that complete graphs are edge smooth and also introduce two conditions such that G is edge singular if and only if G satisfies these conditions.

Edge Singularity
Let G be a simple graph on [n].For each subset S ⊂ [n], a prime ideal, P S (G), is defined in [2].Let T = [n]\S, and let G 1 , . . ., G c(S) be the connected components of G T .Here G T is the restriction of G to T whose edges are exactly those edges {i, j} of G for which i, j ∈ T. For each G i we denote by Gi the complete graph on the vertex set V(G i ).Setting ).
By corollary 3.9 [2] some of P S (G)'s construct the set of minimal prime ideals of J G .We define the graph G is edge smooth if the affine variety of the binomial edge ideal of G is nonsingular at every nonzero point.Otherwise G is called edge singular.

Theorem 2. Any complete graph G is edge smooth.
Proof.Let G be a simple complete graph on [n].
is Cohen-Macaulay and hence by corollary 3.4 [2], we have dimY = dim S J G = n + 1.We must show that for all 0 = p = (p 1 , . . ., p n , q 1 , . . ., 2 and It is enough to show that rank ( ∂f i ∂x j )(p) = n − 1, for all 0 = p = (p 1 , . . ., p n ) ∈ K n .Without loss of generality assume p 1 = 0.By setting suitable order on f ij 's (that is f 12 , f 13 , . . ., f 1n , f 23 , f 24 , . . ., f n−1n ), the first half of the Jacobian matrix is represented by the following matrix: Multiply the first row by y −1 1 y 3 and add it to the n'th row, and multiply the first row by y −1 1 y 4 then add it to the n + 1'th row, and in the same way multiply the first row by y −1 1 y n and add the result to the 2n − 3'th row.Continuing this pattern for the second row to the n − 1'th row.We observe that all rows become zero except the first n − 1 rows, so rank By the appropriate order on f ij 's we have: By using the same way explained in the proof of Theorem 2, the rank of this matrix is 3 at any nonzero point of K 4 .So G is a edge smooth graph.
The following theorem characterizes all edge singular graphs.Two conditions introduced in this theorem can be checked algorithmically.This theorem also shows that edge singularity is just a combinatorial property and does not depend on K. Theorem 3. Let G be a simple connected graph on the vertex set [n].The graph G is edge singular if and only if there exists S ⊂ [n] which satisfies the following conditions: 1. S = ∅ and for each i ∈ S one has c(S\{i}) < c(S).

c(S) < n − |S|.
Proof.Assume that there is some S ⊂ [n] that satisfies conditions 1 and 2. By corollary 3.9 [2] the first condition implies that P S (G) ∈ MinJ G .Let G 1 , . . ., G c(S) be the connected components of G T .Put the following labeling for the vertices of G; • v 1 , . . ., v s are the vertices corresponded to S, • v s+1 , . . ., v t 1 are the vertices of G 1 , • v t 1 +1 , . . ., v t 2 are the vertices of G 2 , . . .
Now the Jacobian matrix of P S (G) has the following form; where A 1 and A 2 are |S| × |S| identity matrices and (B 1 |D 1 ), . . ., (B c(S) |D c(S) ) are the Jacobian matrices of J G1 , . . ., J Gc(S) respectively.
By choosing Q = (Q 1 , . . ., Q 2n ) ∈ K 2n as the following Otherwise the rank of Jacobian matrix of P S (G) at Q is equal to 2|S|.On the other hand we know that; So G is edge singular.Now suppose that G is an edge singular graph.Then there is some S ⊂ [n] that P S (G) ∈ MinJ G , and there exists nonzero Q in K 2n such that the rank of the Jacobian matrix of P S (G) at Q is less than n + |S| − c(S).If c(S) = n − |S|, then this rank is less than 2|S|, but this is a contradiction since the rank of the Jacobian matrix of P S (G) is greater than or equal to 2|S|.Hence we have c(S) < n − |S|.Moreover, note that S is not empty since if S is empty then P S (G) is equal to the binomial edge ideal of the complete graph, but complete graphs are edge smooth by Theorem 2.
Example 2. Let G be the following graph: We set S = {1, 6}.This S satisfies the mentioned conditions in Theorem 3, then G is edge singular.
The following example illustrates Theorem 2 is not two sided that is any edge smooth graph is not necessarily complete.Also this shows any non complete graph is not necessarily edge singular.
Example 3. Let G be the following graph: There does not exist S ⊂ [n] that satisfies the conditions of Theorem 3. Hence G is edge smooth.
Corollary 4. For all n ≥ 5, G = C n is a singular graph.
Proof.Put S = {1, 4}.G [n]\S separates into two connected components (in case C 5 , it separates into an edge and an isolated vertex).Also S satisfies the first condition of Theorem 3, so a cycle with n vertices, n ≥ 5, is a singular graph.

Corollary 5.
A tree is a singular graph if the number of vertices which are not leaf, is at least 2.
Proof.Assume that the three of the non-leaf vertices are k, k + 1.Put S = {k}.One can check easily that S satisfies the conditions of Theorem 3.

Example 4.
Let G be the following graph: Put S = {4}.S satisfies the conditions of Theorem 3.
Corollary 6.For all n, m, K n,m is a smooth graph.With the same argument it is concluded that all complete multipartite graphs are edge singular.

Conclusions
Smoothness is a geometric property which could be studied by algebraic tools.In this paper smoothness of some varieties are studied by algebraic and combinatorial properties of corresponded combinatorial objects.

Proof.
Let S ⊂ [n + m].G [n+m]\S is a connected graph unless either S contains n vertices of a part of G or m vertices of the other part.If S just contains the whole vertices of one part of G, then S does not satisfy the second condition of Theorem 3, and if S is the another subset of [n + m], S does not satisfy the first condition of Theorem 3.So K n,m is a smooth graph.Remark 1.