The universal Gröbner basis of a binomial edge ideal
|
|
- Victoria Clarke
- 5 years ago
- Views:
Transcription
1 The universal Gröbner basis of a binomial edge ideal Mourtadha Badiane Isaac Burke Emil Sköldberg National University of Ireland, Galway Galway, Ireland {m.badiane1,i.burke1,emil.skoldberg}@nuigalway.ie Submitted: Feb 3, 2016; Accepted: Sep 28, 2017; Published: Oct 6, 2017 Mathematics Subject Classifications: 13P10, 05E40 Abstract We show that the universal Gröbner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity binomial edge ideal and prove this conjecture for the case when the underlying graph is the complete graph. Keywords: Binomial edge ideals; Parity binomial edge ideals; universal Gröbner basis; Graver basis 1 Introduction For n N >0, [n] := {1,..., n}. Let G be a simple graph on the vertex set [n], that is, G has no loops and no multiple edges. Let E(G) denote the edge set of G. Let F be a field and let S = F [x 1,..., x n, y 1,..., y n ] be the polynomial ring in 2n variables. The binomial edge ideal of G was introduced and studied independently by Herzog, Hibi, Hreinsdóttir, Kahle and Rauh [2] and Ohtani [6]. Definition 1.1. The binomial edge ideal of G is J G := x i y j x j y i : {i, j} E(G) S. (1.1) The parity binomial edge ideal of G was introduced and studied by Kahle, Sarmiento and Windisch [5] but had previously been examined by Herzog, Macchia, Madani and Welker [3]. Supported by the Irish Research Council and the Hardiman Scholarship Scheme the electronic journal of combinatorics 24(4) (2017), #P4.11 1
2 Definition 1.2. The parity binomial edge ideal of G is I G := x i x j y i y j : {i, j} E(G) S. (1.2) These ideals appear in various settings and applications in mathematics and statistics and belong to an important class of binomial ideals which may be defined as follows. If we let R = F [x 1,..., x n ] then an ideal I of R is a pure difference ideal (also known in the literature as a pure binomial ideal) if I is generated by differences of monic monomials i.e. binomials of the form x u x v with u, v N n. There are several well-known distinguished subsets of binomials in such an ideal I, two of which we now mention. A binomial x u x v I is called primitive if there exists no other binomial x u x v I such that x u divides x u and x v divides x v. The set of primitive binomials in I is called the Graver basis of I and denoted Gr(I). The union of all of the reduced Gröbner bases of I is called the universal Gröbner basis of I and denoted U(I). Graver bases were originally defined for toric ideals by Sturmfels [8]. Charalambous, Thoma and Vladoiu [1] recently generalised the concept to an arbitrary pure difference ideal I. They show that Gr(I) is finite and extend an argument of Sturmfels to prove that U(I) Gr(I). One open problem that arises in the literature is providing a combinatorial characterisation of toric ideals for which the universal Gröbner basis and the Graver basis are equal (many examples have been discovered, see Petrović, Thoma and Vladoiu [7] and references therein). We consider this problem for certain classes of pure difference ideals that are not lattice ideals. In particular, we show that U(J G ) = Gr(J G ) and provide a description for this basis set in terms of certain paths in G. We conjecture a similar result for I G and prove this conjecture for the case when G is the complete graph. 1.1 Preliminaries Throughout the paper we assume that G is finite, undirected and connected. For any W [n], let G[W ] denote the induced subgraph on W, and for a sequence of vertices π = (i 0,..., i r ) [n] r+1, G[π] := G[{i 0,..., i r }]. A (v, w)-path of length r is a sequence of vertices v = i 0, i 1,..., i r = w such that {i k, i k+1 } E(G) for all k = 0,..., r 1. The path is odd (even) if its length is odd (even). The interior of a (v, w)-path π = (i 0,..., i r ) is the set int(π) = {i 0,..., i r } \ {v, w}. The inverse π 1 of a (v, w)-path π = (i 0,..., i r ) is the (w, v)-path (i r, i r 1,..., i 0 ). For the vertex set of a graph H we sometimes use the notation V (H). For a monomial x u = x d 1 1 y e 1 1 x dn n yn en in S the set {i : d i 0 or e i 0} [n] is denoted by V (x u ). 2 Binomial Edge Ideals In this section we will use two different gradings on S, the first is the N 2 -grading by considering the letter of a variable, so we let ldeg(x i ) = (1, 0) and ldeg(y i ) = (0, 1) for all i [n]. The second is the N n -grading which considers the vertex of a variable and we set gdeg(x i ) = gdeg(y i ) = e i for all i [n], where e i is the ith standard basis vector in N n. The the electronic journal of combinatorics 24(4) (2017), #P4.11 2
3 ideal J G is homogeneous with respect to both of these gradings and we combine them into what we call the multidegree of a monomial mdeg(x u ) := (ldeg(x u ), gdeg(x u )) N 2 N n. We now recall the definition of admissible paths and the description of the Gröbner basis of J G with respect to the lexicographic order which was independently obtained by Herzog et al. [2] and Ohtani [6]. Definition 2.1. Fix a permutation σ S n of [n] and let i, j [n] satisfy σ 1 (i) < σ 1 (j). An (i, j)-path π = (i 0,..., i r ) in G is called σ-admissible, if (i) i k i l if k l; (ii) j 0,..., j s is not a path from i to j for any proper subset {j 0,..., j s } of {i 0,..., i r }; (iii) for each k = 1,..., r 1, either σ 1 (i k ) < σ 1 (i) or σ 1 (i k ) > σ 1 (j). Given a σ-admissible (i, j)-path π = (i 0,..., i r ) in G, where σ 1 (i) < σ 1 (j), u π := x ik. σ 1 (i k )<σ 1 (i) y ik σ 1 (i k )>σ 1 (j) Theorem 2.2 ([2], [6]). The set of binomials G G,σ := {u π (x i y j x j y i ) : π is a σ-admissible (i, j)-path in G} σ 1 (i)<σ 1 (j) is the reduced Gröbner basis of J G w.r.t. the lexicographic monomial order on S induced by x σ(1) x σ(n) y σ(1) y σ(n). Our first result is a characterisation of the binomials in J G. For this we need to introduce the following notations. We denote by d G (v, w) the length of a shortest (v, w)- path in G. For a monomial x u = x d 1 1 y e 1 1 x dn n yn en S, we sometimes use the notation deg xi (x u ) for d i and deg yi (x u ) for e i. For an induced subgraph H of G, we define the restriction of x u to H to be res H (x u ) = Π i V (H) x d i i ye i i. Lemma 2.3. Let x u x v be a multi-homogeneous binomial such that G[V (x u )] is a connected graph. Then x u x v J G. Proof. Suppose that m = x u is a monomial such that there is a pair of indices i < j with deg xi (m) 1 and deg yj (m) 1. Let G = G[V (m)]. We can assume that i and j are chosen such that d G (i, j) is minimal. Now we consider an (i, j)-path π = (i 0,..., i r ) of minimal length in G. Since π is of minimal length we can conclude that i k i l for k l and that no proper subset {j 0,..., j s } of {i 0,..., i r } is a path from i to j. Suppose that there is a k such that i < i k < j, then either deg xik (m) 1, in which case d G (i k, j) < d G (i, j) which contradicts the minimality of d G (i, j), or deg yik (m) 1, in which case d G (i, i k ) < d G (i, j) which again contradicts the minimality of d G (i, j). We may thus conclude that π is a σ-admissible (i, j)-path in G, where σ = id, the identity permutation in S n. the electronic journal of combinatorics 24(4) (2017), #P4.11 3
4 Now we consider the vertex i k on π. By the minimality of d G (i, j), if i k < i then deg xik (m) = 0 and if i k > j then deg yik (m) = 0. We may thus conclude that u π x i y j divides m, and therefore m is reducible with respect to G G,id. This shows that an irreducible monomial of the same multidegree as x u has the form x w = y e 1 i 1 y e k i k x d k i k x d l i l where i 1 < i 2 < < i l. Since there is only one such monomial in a given multidegree, we can conclude that x u x v reduces to zero with respect to G G,id and thus x u x v J G. Lemma 2.4. A multi-homogeneous binomial x u x v lies in J G if and only if mdeg(res C (x u )) = mdeg(res C (x v )) for all connected components C of G[V (x u )]. Proof. Let x u x v J G, then we can write x u x v = k x w k (x ik y jk x jk y ik ) where {i k, j k } E(G) for all k. Let C be a component in G[V (x u )], then by restricting to C we get res C (x u ) res C (x v ) = res C (x w k )(x ik y jk x jk y ik ) k,i k V (C) since j k V (C) if and only if i k V (C). Thus we see that res C (x u ) res C (x v ) J G, and therefore mdeg(res C (x u )) = mdeg(res C (x v )). For the converse, suppose x u x v satisfies that mdeg(res C (x u )) = mdeg(res C (x v )) for all connected components C 1,... C r of G[V (x u )], then, by Lemma 2.3, res Ci (x u ) res Ci (x v ) J G for all r, and we can write x u x v = r i=1 x u i 1 j=1 res C i (x v ) i j=1 res C i (x u ) (res C i (x u ) res Ci (x v )), which shows that x u x v J G. Definition 2.5. An (i, j)-path π = (i 0,..., i r ) in G is called weakly admissible if it satisfies conditions (i) and (ii) of the definition of a σ-admissible path. Given a weakly admissible (i, j)-path π = (i 0,..., i r ) in G, S π := {t i1 t i2 t ir 1 (x i y j x j y i ) : t k {x k, y k }} and S(J G ) := π S π \ {0} where π runs over all weakly admissible paths in G. Notice that if π is an (i, i)-path in G, then π is weakly admissible if and only if π is the path (i) of length 0, in which case S π = {0}. the electronic journal of combinatorics 24(4) (2017), #P4.11 4
5 Figure 1: See Examples 1 and 2. Example 1. Let G be the graph in Figure 1. The weakly admissible paths in G are the paths (1), (2), (3), (4), (1, 2), (1, 3), (2, 3), (2, 4), (1, 2, 4) and (3, 2, 4), together with their inverses. Hence S(J G ) = 16. Theorem 2.6. The sets S(J G ), U(J G ) and Gr(J G ) coincide. Proof. We prove the theorem in three steps; the containments S(J G ) U(J G ), U(J G ) Gr(J G ) and Gr(J G ) S(J G ). Step 1. S(J G ) U(J G ): Let π = (i 0,..., i r ) be a weakly admissible (i, j)-path in G and let f = t i1 t i2 t ir 1 (x i y j x j y i ) be a corresponding binomial in S(J G ). Now let σ S n be a permutation such that σ 1 (i) < σ 1 (j), σ 1 (i k ) < σ 1 (i) for all k such that t ik = y ik and σ 1 (i k ) > σ 1 (j) for all k such that t ik = x ik. Then f G G,σ and thus f U(J G ). Step 2. U(J G ) Gr(J G ): [1, Proposition 4.2]. Step 3. Gr(J G ) S(J G ): Let x u x v be a primitive binomial in J G and let C be a component of G[V (x u )]. By Lemma 2.4 we have that res C (x u ) res C (x v ) J G, so by primitivity we can conclude that C := G[V (x u )] is connected. Since u v we can choose i, j V (x u ) such that d C (i, j) is minimal among all pairs i, j with deg xi (x u ) > deg xi (x v ) and deg yj (x u ) > deg yj (x v ). Now let π = (i 0,..., i r ) be an (i, j)-path in C of minimal length. Suppose that there is a k {1,..., r 1} such that deg xik (x u ) deg xik (x v ). Then either deg xik (x u ) > deg xik (x v ), in which case d C (i k, j) would contradict the minimality of d C (i, j), or deg xik (x u ) < deg xik (x v ), in which case by homogeneity we would have deg yik (x u ) > deg yik (x v ) and thus d C (i, i k ) would contradict the minimality of d C (i, j). So for k {1,..., r 1} we have deg xik (x u ) = deg xik (x v ) and hence by homogeneity deg yik (x u ) = deg yik (x v ). We can then, for k = 1,..., r 1, let z ik {x ik, y ik } such that z ik divides x u and thus also x v. Then z i1 z ir 1 (x i y j x j y i ) J G with z i1 z ir 1 x i y j x u and z i1 z ir 1 x j y i x v, which implies that x u x v = z i1 z ir 1 (x i y j x j y i ) S(J G ). 3 Parity Binomial Edge Ideals In this section we will use two different gradings on S, but not exactly as in the previous section. The first grading is the Z 2 2-grading by considering the letter of a variable, so we let ldeg(x i ) = (1, 0) Z 2 2 and ldeg(y i ) = (0, 1) Z 2 2 for all i [n]. The second is the N n -grading as in the previous section. The ideal I G is homogeneous with respect to both of these gradings and we combine them into what we call the multidegree of a monomial mdeg(x u ) := (ldeg(x u ), gdeg(x u )) Z 2 2 N n. the electronic journal of combinatorics 24(4) (2017), #P4.11 5
6 Lemma 3.1 ([5]). Let π = (i 0,..., i r ) be an (i, j)-path in G and for k int(π), let t k {x k, y k } be arbitrary. If π is odd, then (x i x j y i y j ) t k I G. k int(π) If π is even, then (x i y j y i x j ) t k I G. k int(π) Definition 3.2. An (i, j)-path π in G is called minimal, if (i) for no k int(π) there is an (i, j)-path with the same parity as π in G[π \ {k}]; (ii) there is no shorter (i, j)-path π in G satisfying parity(π ) = parity(π) and int(π ) = int(π). For a minimal (i, j)-path π in G, we define a set of binomials S π as follows. If π is odd, then S π := S + π,o S π,o where S + π,o := {(x i x j y i y j ) S π,o := {(y i y j x i x j ) If π is even, then S π := S π,e where S π,e := {(x i y j y i x j ) k int(π) k int(π) k int(π) t k : t k {x k, y k }}, t k : t k {x k, y k }}. t k : t k {x k, y k }}. S(I G ) := π S π \ {0} where π runs over all minimal paths in G. Notice that if π is an even (i, i)-path in G, then π is minimal if and only if π is the path (i) of length 0, in which case S π = {0}. Example 2. Let G be the graph in Figure 1. The minimal paths in G are the paths (1), (2), (3), (4), (1, 2), (1, 3), (2, 3), (2, 4), (1, 2, 3), (1, 2, 4), (1, 3, 2), (2, 1, 3), (3, 2, 4), (1, 2, 3, 1), (1, 3, 2, 4), (2, 1, 3, 2), (3, 1, 2, 3), (3, 1, 2, 4), (2, 1, 3, 2, 4), (2, 3, 1, 2, 4) and (4, 2, 1, 3, 2, 4), together with their inverses. Hence S(I G ) = 92. the electronic journal of combinatorics 24(4) (2017), #P4.11 6
7 Given a graph G, it is clear that the set of its weakly admissible paths is a subset of the set of its minimal paths. If π is a minimal (i, j)-path in G which is not a weakly admissible path, π contains repeated vertices or G[π] contains an (i, j)-path π of parity opposite to that of π such that int(π ) int(π). Conjecture 3.3. The sets S(I G ), U(I G ) and Gr(I G ) coincide. We have partially tested Conjecture 3.3 for small graphs using the software gfan [4] and have found no counterexamples so far. It must be said, however, that we are not currently aware of any algorithm for computing the Graver basis of an arbitrary pure difference ideal. The main result of this section is a proof that Conjecture 3.3 holds when G is the complete graph K n on the vertex set [n]. The rest of the section is arranged as follows. In Lemmas 3.4 through 3.7 we describe a reduced Gröbner basis of I Kn. In Lemmas 3.8 through 3.12 we characterise the binomials in I Kn. In Theorem 3.13 the main result is proved. Lemma 3.4. The minimal paths in K n are all (i), (i, j), (i, k, j) and (i, k, l, i) where i, j, k and l are distinct elements of [n]. Proof. Let π = (i 0,..., i r ) be an (i, j)-path in K n. Suppose that π is odd. If int(π) = then π is necessarily of the form (i, j, i, j,..., i, j) and thus minimal if and only if π = (i, j). If int(π) then there are two cases: i = j and i j. If i = j then int(π) 2 so let i s1 i s2 int(π) and notice that K n contains the odd path π = (i 0, i s1, i s2, i 0 ). Now K n [π \ {i s1 }] = K n [π \ {i s2 }] = K 2 which does not contain an odd cycle, hence π is minimal. It follows that π is minimal if and only if π = (i, k, l, i), where {k, l} = int(π). If i j then for all k int(π) the graph K n [π \ {k}] contains the odd (i, j)-path π = (i, j), hence π is not minimal in this case. The proof for an even path is similar and omitted. Given a permutation σ S n of [n] and a set L [n] let denote the lexicographic monomial order on S induced by t σ(1) t σ(n) t σ(1) t σ(n) where t σ(i) = x σ(i), t σ(i) = y σ(i) for all i [n] \ L and t σ(i) = y σ(i), t σ(i) = x σ(i) for all i L. For i, j [n] write i j if σ 1 (i) < σ 1 (j). Let G (G) denote the reduced Gröbner basis of I G with respect to. For a nonzero f S let N G (G)(f) denote the normal form of f with respect to G (G) and let in (f) denote the initial monomial of f with respect to. For the next three lemmas (3.5 to 3.7) fix a permutation σ S n and a set L [n]. For v [n] c v := { +1 if σ 1 (v) / L 1 if σ 1 (v) L; r v := { y v if σ 1 (v) / L x v if σ 1 (v) L. the electronic journal of combinatorics 24(4) (2017), #P4.11 7
8 For i, j, k, l [n] let B (i,j) = {c i (x i x j y i y j ) : i j}, B (i,k,j) = {c i (x i y j y i x j )r k : i, k j} and B (i,k,l,i) = {c i (x 2 i yi 2 )r k r l : k, l i}. Notice that for an element f ( ) B (i,j) B (i,k,j) B (i,k,l,i), the value of ci ensures that the coefficient of the initial monomial in (f) is 1. Finally let the set Γ B (i,k,j) consist of all binomials f = c i (x i y j y i x j )r k B (i,k,j) satisfying i k j and {σ 1 (i), σ 1 (k)} L = 1. Lemma 3.5. Let f S be a nonzero binomial corresponding to a minimal path π in K n (in the sense of Lemma 3.1). Then f is reduced with respect to if and only if f Λ := ( B (i,j) B (i,k,j) B (i,k,l,i) ) \ Γ. Proof. By Lemma 3.4 it suffices to consider only binomials corresponding to the paths (i, j), (i, k, j) and (i, k, l, i) in K n, where i, j, k and l are distinct elements of [n]. Without loss of generality we may assume that i j. If f is the binomial corresponding to the path (i, j) then clearly f is reduced if and only if f B (i,j) Λ. If f is a binomial corresponding to the path (i, k, j) then there are three conceivable cases: i j k, i k j and k i j. For ease of notation f t (i,j,k) := c i(x i y k y i x k )t j where the superscript t {x, y} indicates whether t j = x j or t j = y j. Case 1 (i j k). If σ 1 (i) L then f(i,k,j) x is reduced by x ix k y i y k ; also f y (i,k,j) is reduced by f y (i,j,k) if σ 1 (j) L, or y j y k x j x k if σ 1 (j) L. If σ 1 (i) L then f(i,k,j) x is reduced by x j x k y j y k if σ 1 (j) L, or f(i,j,k) x if σ 1 (j) L; also f y (i,k,j) is reduced by y i y k x i x k. Case 2 (i k j). If σ 1 (i) L then f x (i,k,j) is reduced by x ix k y i y k ; also f y (i,k,j) is reduced by y k y j x k x j if σ 1 (k) L but is irreducible if σ 1 (k) L. If σ 1 (i) L then f x (i,k,j) is reduced by x kx j y k y j if σ 1 (k) L but is irreducible if σ 1 (k) L; also f y (i,k,j) is reduced by y i y k x i x k. Case 3 (k i j). If σ 1 (i) L then f x (i,k,j) is reduced by x kx i y k y i if σ 1 (k) L but is irreducible if σ 1 (k) L; also f y (i,k,j) is reduced by y ky j x k x j if σ 1 (k) L but is irreducible if σ 1 (k) L. If σ 1 (i) L then f x (i,k,j) is reduced by x kx j y k y j if σ 1 (k) L but is irreducible if σ 1 (k) L; also f y (i,k,j) is reduced by y ky i x k x i if σ 1 (k) L but is irreducible if σ 1 (k) L. Finally let f = c i (x 2 i y 2 i )t k t l be a binomial corresponding to the path (i, k, l, i). If i k then f is reduced by one of f x (i,l,k), f y (i,l,k) or c i(x i x k y i y k ). The case i l is similar. If k, l i then by arguing as before one finds that f is irreducible if and only if t s = y s whenever σ 1 (s) L and t s = x s whenever σ 1 (s) L. Lemma 3.6. Let π be an (i, j)-path in K n and for k int(π), let t k {x k, y k } be arbitrary. Then (x i x j y i y j )Π k int(π) t k if π is odd and (x i y j y i x j )Π k int(π) t k if π is even, reduce to zero modulo Λ. Proof. It suffices to restrict to a minimal path π (if π is not minimal, then its binomial is a multiple of the binomial for a shorter path). If π is minimal, then Lemma 3.5 gives the result. Lemma 3.7. G (K n ) = Λ. the electronic journal of combinatorics 24(4) (2017), #P4.11 8
9 Proof. The proof is by Buchberger s criterion and is similar to the proof of Theorem 3.6 in Kahle et al. [5]. Let g, g Λ be reduced binomials corresponding, respectively, to the odd path π = (i, k, l, i) in K n and the even path π = (u, v, w) in K n. Consider the case that {i, k, l} {u, v, w} = 3. Since k, l i and u, v w we may assume without loss of generality that i = w, k = u and l = v. Thus g = c i (x 2 i y 2 i )r k r l, g = c k (x k y i y k x i )r l. There are four possibilities for the constants c i, c k. By duality we need only consider (c i, c k ) = (1, 1) and (c i, c k ) = ( 1, 1). If (c i, c k ) = (1, 1) then r k = y k and spol(g, g ) = (x k y 3 i y k x 3 i )y k r l = (y k y 2 i ) g + (y k x i ) g + 0 and in (spol(g, g )) in ( y k y 2 i g ), in (y k x i g). If (c i, c k ) = ( 1, 1) then spol(g, g ) = (x k x i y k y i )x i y k r l which is a monomial multiple of the binomial corresponding to the path (k, i) in K n and thus reduces to zero by Lemma 3.6. In a similar fashion to the above all spol(g, g ) (where g, g Λ) reduce to zero with respect to Λ. Thus the set Λ fulfills Buchberger s criterion and hence is a Gröbner basis of I Kn. By Lemma 3.5 it follows that the elements of Λ are reduced with respect to. Lemma 3.8. Let f = x u x v S be multi-homogeneous with V (x u ) = {i, j}. If gcd(x u, x v ) = 1 then f {±(x p i xq j yp i yq j ), ±(xp i yq j yp i xq j ) : p, q 1, parity(p) = parity(q)}. Proof. By homogeneity f is necessarily of the form x u x v = x d i i ye i i xd j j ye j j x d i i ye i i xd j j ye j j satisfying d i + e i = d i + e i and d j + e j = d j + e j. By gcd(x u, x v ) = 1 it follows that if d i > 0 then d i = 0 and similarly for all exponents. But if d i > 0 then d i > 0 or e i > 0 i.e. e i > 0 (since d i = 0) which in turn implies e i = 0. If d j > 0 we get a similar result. If d j = 0 then by V (x u ) = {i, j} we have e j > 0. By inverting the argument we obtain x u x v {±(x d i i xd j j y e i i ye j j ), ±(xd i i ye j j y e i i xd j j )}. The result follows from the implications of homogeneity. Lemma 3.9. Let be the lexicographic monomial order on S corresponding to σ = id and L =. Let x u = x d 1 1 y e 1 1 x dn n yn en S where V (x u ) > 2. Let k = max{i : i V (x u )} and let γ = k i=1 d i. { N G (Kn)(x u y d 1+e 1 1 y d k+e k k, if γ is even ) = x k y d 1+e 1 1 y d k 1+e k 1 k 1 y d k+e k 1 (3.1) k, if γ is odd. the electronic journal of combinatorics 24(4) (2017), #P4.11 9
10 Proof. The forms in (3.1) are clearly irreducible. By Lemma 3.7 we have x i x j y i y j G (K n ) for all i j [n], so that x u can be reduced to x u = x ds l s y d 1+e 1 1 y d s 1+e s 1 s 1 y es+l s y d s+1+e s+1 s+1 y d k+e k k for some 1 s k where l Z 0, l d s. By the homogeneity of x i x j y i y j parity( k i=1 d i) = parity(d s l). If d s = l then we are done. Otherwise we consider the following two cases. If 1 s k 1 then by V (x u ) > 2 there exists v V (x u ) \ {s}, v k. Since v, s k, by Lemma 3.7 f = y v (x s y k y s x k ) G (K n ). Using f and x s x k y s y k G (K n ) in that order x u can be reduced to x u = x ds l 2 s y d 1+e 1 1 y d s 1+e s 1 s 1 y es+l+2 s y d s+1+e s+1 s+1 y d k+e k k. Repeated iteration of this step gives one of the forms in (3.1), depending on the parity of d s l. If s = k then by V (x u ) > 2 there exist v 1, v 2 V (x u ) \ {k}, v 1 v 2. Since v 1, v 2 k, by Lemma 3.7 f = y v1 y v2 (x 2 k y2 k ) G (K n ). Using f we can reduce x u to one of the forms in (3.1), depending on the parity of d s l. Lemma Let be the lexicographic monomial order on S corresponding to σ = id and L =. Let x u = x d i i ye i i xd j j ye j j S i.e. V (x u ) 2. Let q = min{d i, d j }. N G (K n)(x u ) = x d i q i y e i+q i x d j q j y e j+q j. (3.2) Proof. The monomial x u can be reduced to (3.2) by the binomial x i x j y i y j G (K n ) (Lemma 3.7). No element of the set {in (g) : g G (K n )} divides (3.2) hence (3.2) is irreducible. Lemma Let f = x u x v S be such that V (x u ) > 2. Then f I Kn if f is multi-homogeneous. if and only Proof. : This is clear. : Suppose f is multi-homogeneous in degree ((α 1, α 2 ), β) Z 2 2 N n. Let be the lexicographic monomial order on S corresponding to σ = id and L =. Let k = max{i : i V (x u )}. If α 1 = 0 then N G (K n)(x u ) = N G (K n)(x v ) is the first form in (3.1) and if α 1 = 1 then N G (K n)(x u ) = N G (K n)(x v ) is the second form in (3.1). Lemma Let f = x u x v S be such that V (x u ) 2. Then f I Kn if f is of the form x d i i ye i i xd j j ye j j x d i q i y e i+q i x d j q j y e j+q j where q Z. if and only Proof. : f = x u x v I N G (K n)(x u ) = N G (K n)(x v ) where is the lexicographic monomial order on S corresponding to σ = id and L =. Apply Lemma : Apply Lemma Theorem Conjecture 3.3 holds for G = K n. Proof. Let G = K n throughout. We prove the theorem in three steps; the containments S(I G ) U(I G ), U(I G ) Gr(I G ) and Gr(I G ) S(I G ). the electronic journal of combinatorics 24(4) (2017), #P
11 Step 1. S(I G ) U(I G ): Here we invoke Lemmas 3.4 and 3.7. If π is a path of the form (i, k, l, i) in G then let σ S n be a permutation such that k, l i. A suitable choice of L {σ 1 (i), σ 1 (k), σ 1 (l)} then provides that (x 2 i y 2 i )r k r l G (G) or (y 2 i x 2 i )r k r l G (G). The cases π = (i, k, j) and π = (i, j) are similar and omitted. Step 2. U(I G ) Gr(I G ): [1, Proposition 4.2]. Step 3. Gr(I G ) S(I G ): Let f = x u x v Gr(I G ). If V (x u ) 2 then by Lemma 3.12 we have f = x d i i ye i i xd j j ye j j x d i q i y e i+q i x d j q j y e j+q j where q Z. If q > 0 then necessarily f = x i x j y i y j S(I G ). If q < 0 then necessarily f = y i y j x i x j S(I G ). Now consider the case that V (x u ) > 2. First suppose that f = t k (x u x v ) where k V (x u ) and t k {x k, y k }. Now x u x v is multi-homogeneous and it must be that V (x u ) = 2 since otherwise by Lemma 3.11 x u x v I G, contradicting the primitivity of f. Write f = t k (x u x v ) = t k (x d i i ye i i xd j j ye j j x d i i ye i i xd j j ye j j ). (3.3) If gcd(x u, x v ) 1 then it follows from the previous argument that f = t k t l (x ds s ys es x d s s y e s s ) where {s, l} {i, j} and t l {x l, y l }. Now x ds s ys es x d s s y e s s is multi-homogeneous and nonzero. These criteria are minimally satisfied by (d s, e s ) {(2, 0), (0, 2)} i.e. f = t k t l (x 2 s ys) 2 S(I G ) or f = t k t l (ys 2 x 2 s) S(I G ). For d s + e s > 2 the primitivity of f is contradicted either by one of these binomials or by an element of the form ±(x i x j y i y j ) S(I G ). If instead in (3.3) gcd(x u, x v ) = 1 then by Lemma 3.8 and the primitivity of f we have f = ±t k (x i y j y i x j ) S(I G ). Suppose now that f = x u x v cannot be written as t k (x u x v ) where k V (x u ) and t k {x k, y k }. Since f is multi-homogeneous and V (x u ) > 2 we can assume that for some i, j V (x u ) either x i x j x u and y i y j x v or y i y j x u and x i x j x v i.e. in this case the primitivity of f is contradicted by an element of the form ±(x i x j y i y j ) S(I G ). Acknowledgements The authors would like to thank the anonymous referee for their careful reading and helpful suggestions. References [1] Hara Charalambous, Apostolos Thoma, and Marius Vladoiu, Binomial fibers and indispensable binomials, Journal of Symbolic Computation 74 (2016), [2] Jürgen Herzog, Takayuki Hibi, Freyja Hreinsdóttir, Thomas Kahle, and Johannes Rauh, Binomial edge ideals and conditional independence statements, Advances in Applied Mathematics 45 (2010), no. 3, [3] Jürgen Herzog, Antonio Macchia, Sara Saeedi Madani, and Volkmar Welker, On the ideal of orthogonal representations of a graph in R 2, Advances in Applied Mathematics 71 (2015), the electronic journal of combinatorics 24(4) (2017), #P
12 [4] Anders N. Jensen, Gfan, a software system for Gröbner fans and tropical varieties, Available at [5] Thomas Kahle, Camilo Sarmiento, and Tobias Windisch, Parity binomial edge ideals, Journal of Algebraic Combinatorics 44 (2016), no. 1, [6] Masahiro Ohtani, Graphs and ideals generated by some 2-minors, Communications in Algebra 39 (2011), no. 3, [7] Sonja Petrović, Apostolos Thoma, and Marius Vladoiu, Bouquet algebra of toric ideals, arxiv: v2 (2015). [8] Bernd Sturmfels, Gröbner bases and convex polytopes, University Lecture Series, vol. 8, American Mathematical Society, Providence, RI, the electronic journal of combinatorics 24(4) (2017), #P
Toric Ideals, an Introduction
The 20th National School on Algebra: DISCRETE INVARIANTS IN COMMUTATIVE ALGEBRA AND IN ALGEBRAIC GEOMETRY Mangalia, Romania, September 2-8, 2012 Hara Charalambous Department of Mathematics Aristotle University
More informationOn the extremal Betti numbers of binomial edge ideals of block graphs
On the extremal Betti numbers of binomial edge ideals of block graphs Jürgen Herzog Fachbereich Mathematik Universität Duisburg-Essen Essen, Germany juergen.herzog@uni-essen.de Giancarlo Rinaldo Department
More informationPRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM
PRIMARY DECOMPOSITION FOR THE INTERSECTION AXIOM ALEX FINK 1. Introduction and background Consider the discrete conditional independence model M given by {X 1 X 2 X 3, X 1 X 3 X 2 }. The intersection axiom
More informationarxiv:math/ v1 [math.ac] 11 Jul 2006
arxiv:math/0607249v1 [math.ac] 11 Jul 2006 MINIMAL SYSTEMS OF BINOMIAL GENERATORS AND THE INDISPENSABLE COMPLEX OF A TORIC IDEAL HARA CHARALAMBOUS, ANARGYROS KATSABEKIS, AND APOSTOLOS THOMA Abstract. Let
More informationmathematics Smoothness in Binomial Edge Ideals Article Hamid Damadi and Farhad Rahmati *
mathematics Article Smoothness in Binomial Edge Ideals Hamid Damadi and Farhad Rahmati * Faculty of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), 424 Hafez
More informationMATHEMATICAL ENGINEERING TECHNICAL REPORTS. Markov Bases for Two-way Subtable Sum Problems
MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov Bases for Two-way Subtable Sum Problems Hisayuki HARA, Akimichi TAKEMURA and Ruriko YOSHIDA METR 27 49 August 27 DEPARTMENT OF MATHEMATICAL INFORMATICS
More informationOn the BMS Algorithm
On the BMS Algorithm Shojiro Sakata The University of Electro-Communications Department of Information and Communication Engineering Chofu-shi, Tokyo 182-8585, JAPAN Abstract I will present a sketch of
More informationarxiv: v1 [math.ac] 11 Dec 2013
A KOSZUL FILTRATION FOR THE SECOND SQUAREFREE VERONESE SUBRING arxiv:1312.3076v1 [math.ac] 11 Dec 2013 TAKAYUKI HIBI, AYESHA ASLOOB QURESHI AND AKIHIRO SHIKAMA Abstract. The second squarefree Veronese
More informationALGEBRAIC PROPERTIES OF BIER SPHERES
LE MATEMATICHE Vol. LXVII (2012 Fasc. I, pp. 91 101 doi: 10.4418/2012.67.1.9 ALGEBRAIC PROPERTIES OF BIER SPHERES INGA HEUDTLASS - LUKAS KATTHÄN We give a classification of flag Bier spheres, as well as
More informationABSTRACT. Department of Mathematics. interesting results. A graph on n vertices is represented by a polynomial in n
ABSTRACT Title of Thesis: GRÖBNER BASES WITH APPLICATIONS IN GRAPH THEORY Degree candidate: Angela M. Hennessy Degree and year: Master of Arts, 2006 Thesis directed by: Professor Lawrence C. Washington
More informationA Saturation Algorithm for Homogeneous Binomial Ideals
A Saturation Algorithm for Homogeneous Binomial Ideals Deepanjan Kesh and Shashank K Mehta Indian Institute of Technology, Kanpur - 208016, India, {deepkesh,skmehta}@cse.iitk.ac.in Abstract. Let k[x 1,...,
More informationarxiv: v1 [math.ac] 6 Jan 2019
GORENSTEIN T-SPREAD VERONESE ALGEBRAS RODICA DINU arxiv:1901.01561v1 [math.ac] 6 Jan 2019 Abstract. In this paper we characterize the Gorenstein t-spread Veronese algebras. Introduction Let K be a field
More informationarxiv: v2 [math.ac] 6 Apr 2016
REGULARITY OF BINOMIAL EDGE IDEALS OF CERTAIN BLOCK GRAPHS arxiv:1601.01086v2 [math.ac] 6 Apr 2016 A. V. JAYANTHAN, N. NARAYANAN, AND B. V. RAGHAVENDRA RAO Abstract. We obtain an improved lower bound for
More informationThe binomial ideal of the intersection axiom for conditional probabilities
J Algebr Comb (2011) 33: 455 463 DOI 10.1007/s10801-010-0253-5 The binomial ideal of the intersection axiom for conditional probabilities Alex Fink Received: 10 February 2009 / Accepted: 27 August 2010
More informationIdeals and graphs, Gröbner bases and decision procedures in graphs
Ideals and graphs, Gröbner bases and decision procedures in graphs GIUSEPPA CARRA FERRO and DANIELA FERRARELLO Department of Mathematics and Computer Science University of Catania Viale Andrea Doria 6,
More informationMONOMIAL IDEALS WHOSE POWERS HAVE A LINEAR RESOLUTION
MATH. SCAND. 95 (2004), 23 32 MONOMIAL IDEALS WHOSE POWERS HAVE A LINEAR RESOLUTION JÜRGEN HERZOG, TAKAYUKI HIBI and XINXIAN ZHENG Introduction In this paper we consider graded ideals in a polynomial ring
More informationMULTIPLICITIES OF MONOMIAL IDEALS
MULTIPLICITIES OF MONOMIAL IDEALS JÜRGEN HERZOG AND HEMA SRINIVASAN Introduction Let S = K[x 1 x n ] be a polynomial ring over a field K with standard grading, I S a graded ideal. The multiplicity of S/I
More informationUnmixed Graphs that are Domains
Unmixed Graphs that are Domains Bruno Benedetti Institut für Mathematik, MA 6-2 TU Berlin, Germany benedetti@math.tu-berlin.de Matteo Varbaro Dipartimento di Matematica Univ. degli Studi di Genova, Italy
More informationOn the stable set of associated prime ideals of monomial ideals and square-free monomial ideals
On the stable set of associated prime ideals of monomial ideals and square-free monomial ideals Kazem Khashyarmanesh and Mehrdad Nasernejad The 10th Seminar on Commutative Algebra and Related Topics, 18-19
More informationFactorization of integer-valued polynomials with square-free denominator
accepted by Comm. Algebra (2013) Factorization of integer-valued polynomials with square-free denominator Giulio Peruginelli September 9, 2013 Dedicated to Marco Fontana on the occasion of his 65th birthday
More informationTHE BUCHBERGER RESOLUTION ANDA OLTEANU AND VOLKMAR WELKER
THE BUCHBERGER RESOLUTION ANDA OLTEANU AND VOLKMAR WELKER arxiv:1409.2041v2 [math.ac] 11 Sep 2014 Abstract. We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in
More informationINITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY. the affine space of dimension k over F. By a variety in A k F
INITIAL COMPLEX ASSOCIATED TO A JET SCHEME OF A DETERMINANTAL VARIETY BOYAN JONOV Abstract. We show in this paper that the principal component of the first order jet scheme over the classical determinantal
More informationFREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS
FREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS N. ALTAFI, N. NEMATI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let S = K[x 1,..., x n ] be the polynomial ring over a field K. In this
More informationarxiv: v2 [math.ac] 24 Sep 2014
When is a Squarefree Monomial Ideal of Linear Type? Ali Alilooee Sara Faridi October 16, 2018 arxiv:1309.1771v2 [math.ac] 24 Sep 2014 Abstract In 1995 Villarreal gave a combinatorial description of the
More informationGröbner bases for the polynomial ring with infinite variables and their applications
Gröbner bases for the polynomial ring with infinite variables and their applications Kei-ichiro Iima and Yuji Yoshino Abstract We develop the theory of Gröbner bases for ideals in a polynomial ring with
More informationBinomial Ideals from Graphs
Binomial Ideals from Graphs Danielle Farrar University of Washington Yolanda Manzano St. Mary s University Juan Manuel Torres-Acevedo University of Puerto Rico Humacao August 10, 2000 Abstract This paper
More informationarxiv: v2 [math.ac] 18 Oct 2018
A NOTE ON LINEAR RESOLUTION AND POLYMATROIDAL IDEALS arxiv:1810.07582v2 [math.ac] 18 Oct 2018 AMIR MAFI AND DLER NADERI Abstract. Let R = K[x 1,..., x n] be the polynomial ring in n variables over a field
More informationT. Hibi Binomial ideals arising from combinatorics
T. Hibi Binomial ideals arising from combinatorics lecture notes written by Filip Rupniewski (email: frupniewski@impan.pl) Binomial Ideals conference 3-9 September 207, Łukęcin, Poland Lecture Let S =
More informationToric Fiber Products
Toric Fiber Products Seth Sullivant North Carolina State University June 8, 2011 Seth Sullivant (NCSU) Toric Fiber Products June 8, 2011 1 / 26 Families of Ideals Parametrized by Graphs Let G be a finite
More informationMCS 563 Spring 2014 Analytic Symbolic Computation Monday 14 April. Binomial Ideals
Binomial Ideals Binomial ideals offer an interesting class of examples. Because they occur so frequently in various applications, the development methods for binomial ideals is justified. 1 Binomial Ideals
More informationPolytopes and Algebraic Geometry. Jesús A. De Loera University of California, Davis
Polytopes and Algebraic Geometry Jesús A. De Loera University of California, Davis Outline of the talk 1. Four classic results relating polytopes and algebraic geometry: (A) Toric Geometry (B) Viro s Theorem
More informationGRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY. Hamid-Reza Fanaï
Opuscula Mathematica Vol. 30 No. 3 2010 http://dx.doi.org/10.7494/opmath.2010.30.3.271 GRAPH CHOOSABILITY AND DOUBLE LIST COLORABILITY Hamid-Reza Fanaï Abstract. In this paper, we give a sufficient condition
More informationarxiv: v1 [math.ac] 18 Mar 2014
LINEARLY RELATED POLYOMINOES arxiv:1403.4349v1 [math.ac] 18 Mar 2014 VIVIANA ENE, JÜRGEN HERZOG, TAKAYUKI HIBI Abstract. We classify all convex polyomino ideals which are linearly related or have a linear
More informationLecture 1. (i,j) N 2 kx i y j, and this makes k[x, y]
Lecture 1 1. Polynomial Rings, Gröbner Bases Definition 1.1. Let R be a ring, G an abelian semigroup, and R = i G R i a direct sum decomposition of abelian groups. R is graded (G-graded) if R i R j R i+j
More informationLOVÁSZ-SAKS-SCHRIJVER IDEALS AND COORDINATE SECTIONS OF DETERMINANTAL VARIETIES
LOVÁSZ-SAKS-SCHRIJVER IDEALS AND COORDINATE SECTIONS OF DETERMINANTAL VARIETIES ALDO CONCA AND VOLKMAR WELKER Abstract Motivated by questions in algebra and combinatorics we study two ideals associated
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationWhen is a squarefree monomial ideal of linear type?
Commutative Algebra and Noncommutative Algebraic Geometry, I MSRI Publications Volume 67, 2015 When is a squarefree monomial ideal of linear type? ALI ALILOOEE AND SARA FARIDI In 1995 Villarreal gave a
More informationDIRAC S THEOREM ON CHORDAL GRAPHS
Seminar Series in Mathematics: Algebra 200, 1 7 DIRAC S THEOREM ON CHORDAL GRAPHS Let G be a finite graph. Definition 1. The graph G is called chordal, if each cycle of length has a chord. Theorem 2 (Dirac).
More informationon Newton polytopes, tropisms, and Puiseux series to solve polynomial systems
on Newton polytopes, tropisms, and Puiseux series to solve polynomial systems Jan Verschelde joint work with Danko Adrovic University of Illinois at Chicago Department of Mathematics, Statistics, and Computer
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationLINEAR RESOLUTIONS OF QUADRATIC MONOMIAL IDEALS. 1. Introduction. Let G be a simple graph (undirected with no loops or multiple edges) on the vertex
LINEAR RESOLUTIONS OF QUADRATIC MONOMIAL IDEALS NOAM HORWITZ Abstract. We study the minimal free resolution of a quadratic monomial ideal in the case where the resolution is linear. First, we focus on
More informationarxiv: v1 [math.ac] 16 Oct 2018
REGULARITY AND h-polynomials OF EDGE IDEALS TAKAYUKI HIBI, KAZUNORI MATSUDA, AND ADAM VAN TUYL arxiv:1810.07140v1 [math.ac] 16 Oct 2018 Abstract. For any two integers d,r 1, we show that there exists an
More informationA degree bound for codimension two lattice ideals
Journal of Pure and Applied Algebra 18 (003) 01 07 www.elsevier.com/locate/jpaa A degree bound for codimension two lattice ideals Leah H. Gold Department of Mathematics, Texas A& M University, College
More informationSome Algebraic and Combinatorial Properties of the Complete T -Partite Graphs
Iranian Journal of Mathematical Sciences and Informatics Vol. 13, No. 1 (2018), pp 131-138 DOI: 10.7508/ijmsi.2018.1.012 Some Algebraic and Combinatorial Properties of the Complete T -Partite Graphs Seyyede
More informationSome D-module theoretic aspects of the local cohomology of a polynomial ring
Some D-module theoretic aspects of the local cohomology of a polynomial ring Toshinori Oaku Tokyo Woman s Christian University July 6, 2015, MSJ-SI in Osaka Toshinori Oaku (Tokyo Woman s Christian University)
More informationOn a class of squarefree monomial ideals of linear type
On a class of squarefree monomial ideals of linear type University of Science and Technology of China Shanghai / November 2, 2013 Basic definition Let K be a field and S = K[x 1,...,x n ] a polynomial
More informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationDISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES
DISCRIMINANTS, SYMMETRIZED GRAPH MONOMIALS, AND SUMS OF SQUARES PER ALEXANDERSSON AND BORIS SHAPIRO Abstract. Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed
More information5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n
5. Grassmannians and the Space of Trees In this lecture we shall be interested in a very particular ideal. The ambient polynomial ring C[p] has ( n d) variables, which are called Plücker coordinates: C[p]
More informationON THE STANLEY DEPTH OF SQUAREFREE VERONESE IDEALS
ON THE STANLEY DEPTH OF SQUAREFREE VERONESE IDEALS MITCHEL T. KELLER, YI-HUANG SHEN, NOAH STREIB, AND STEPHEN J. YOUNG ABSTRACT. Let K be a field and S = K[x 1,...,x n ]. In 1982, Stanley defined what
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More informationarxiv: v2 [math.ac] 29 Sep 2013
FREE RESOLUTION OF POWERS OF MONOMIAL IDEALS AND GOLOD RINGS arxiv:1309.6351v2 [math.ac] 29 Sep 2013 N. ALTAFI, N. NEMATI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let S = K[x 1,...,x n ] be the polynomial
More informationDEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS
DEPTH OF FACTORS OF SQUARE FREE MONOMIAL IDEALS DORIN POPESCU Abstract. Let I be an ideal of a polynomial algebra over a field, generated by r-square free monomials of degree d. If r is bigger (or equal)
More informationAlgebraic Models in Different Fields
Applied Mathematical Sciences, Vol. 8, 2014, no. 167, 8345-8351 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.411922 Algebraic Models in Different Fields Gaetana Restuccia University
More informationNEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS
NEW CLASSES OF SET-THEORETIC COMPLETE INTERSECTION MONOMIAL IDEALS M. R. POURNAKI, S. A. SEYED FAKHARI, AND S. YASSEMI Abstract. Let be a simplicial complex and χ be an s-coloring of. Biermann and Van
More informationHamiltonian Tournaments and Gorenstein Rings
Europ. J. Combinatorics (2002) 23, 463 470 doi:10.1006/eujc.2002.0572 Available online at http://www.idealibrary.com on Hamiltonian Tournaments and Gorenstein Rings HIDEFUMI OHSUGI AND TAKAYUKI HIBI Let
More informationToric Deformation of the Hankel Variety
Applied Mathematical Sciences, Vol. 10, 2016, no. 59, 2921-2925 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2016.6248 Toric Deformation of the Hankel Variety Adelina Fabiano DIATIC - Department
More informationarxiv: v2 [cs.dm] 29 Mar 2013
arxiv:1302.6346v2 [cs.dm] 29 Mar 2013 Fixed point theorems for Boolean networks expressed in terms of forbidden subnetworks Adrien Richard Laboratoire I3S, CNRS & Université de Nice-Sophia Antipolis, France.
More informationarxiv:math/ v1 [math.ac] 11 Nov 2005
A note on Rees algebras and the MFMC property arxiv:math/0511307v1 [math.ac] 11 Nov 2005 Isidoro Gitler, Carlos E. Valencia and Rafael H. Villarreal 1 Departamento de Matemáticas Centro de Investigación
More informationPOLYNOMIAL DIVISION AND GRÖBNER BASES. Samira Zeada
THE TEACHING OF MATHEMATICS 2013, Vol. XVI, 1, pp. 22 28 POLYNOMIAL DIVISION AND GRÖBNER BASES Samira Zeada Abstract. Division in the ring of multivariate polynomials is usually not a part of the standard
More informationSOLUTION TO A COMBINATORIAL PUZZLE ARISING FROM MAYER S THEORY OF CLUSTER INTEGRALS
SOLUTION TO A COMBINATORIAL PUZZLE ARISING FROM MAYER S THEORY OF CLUSTER INTEGRALS OLIVIER BERNARDI Abstract. Mayer s theory of cluster integrals allows one to write the partition function of a gas model
More informationLecture 15: Algebraic Geometry II
6.859/15.083 Integer Programming and Combinatorial Optimization Fall 009 Today... Ideals in k[x] Properties of Gröbner bases Buchberger s algorithm Elimination theory The Weak Nullstellensatz 0/1-Integer
More informationCommuting birth-and-death processes
Commuting birth-and-death processes Caroline Uhler Department of Statistics UC Berkeley (joint work with Steven N. Evans and Bernd Sturmfels) MSRI Workshop on Algebraic Statistics December 18, 2008 Birth-and-death
More informationA note on the Isomorphism Problem for Monomial Digraphs
A note on the Isomorphism Problem for Monomial Digraphs Aleksandr Kodess Department of Mathematics University of Rhode Island kodess@uri.edu Felix Lazebnik Department of Mathematical Sciences University
More informationSYMMETRIC DETERMINANTAL REPRESENTATIONS IN CHARACTERISTIC 2
SYMMETRIC DETERMINANTAL REPRESENTATIONS IN CHARACTERISTIC 2 BRUNO GRENET, THIERRY MONTEIL, AND STÉPHAN THOMASSÉ Abstract. This paper studies Symmetric Determinantal Representations (SDR) in characteristic
More informationCHARACTERIZATION OF GORENSTEIN STRONGLY KOSZUL HIBI RINGS BY F-INVARIANTS
CHARACTERIZATION OF GORENSTEIN STRONGLY KOSZUL HIBI RINGS BY F-INVARIANTS KAZUNORI MATSUDA Abstract. Hibi rings are a kind of graded toric ring on a finite distributive lattice D = J(P ), where P is a
More informationAcyclic Digraphs arising from Complete Intersections
Acyclic Digraphs arising from Complete Intersections Walter D. Morris, Jr. George Mason University wmorris@gmu.edu July 8, 2016 Abstract We call a directed acyclic graph a CI-digraph if a certain affine
More informationCLASSIFICATION OF TORIC MANIFOLDS OVER AN n-cube WITH ONE VERTEX CUT
CLASSIFICATION OF TORIC MANIFOLDS OVER AN n-cube WITH ONE VERTEX CUT SHO HASUI, HIDEYA KUWATA, MIKIYA MASUDA, AND SEONJEONG PARK Abstract We say that a complete nonsingular toric variety (called a toric
More informationDIANE MACLAGAN. Abstract. The main result of this paper is that all antichains are. One natural generalization to more abstract posets is shown to be
ANTICHAINS OF MONOMIAL IDEALS ARE FINITE DIANE MACLAGAN Abstract. The main result of this paper is that all antichains are finite in the poset of monomial ideals in a polynomial ring, ordered by inclusion.
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationIndispensable monomials of toric ideals and Markov bases
Journal of Symbolic Computation 43 (2008) 490 507 www.elsevier.com/locate/jsc Indispensable monomials of toric ideals and Markov bases Satoshi Aoki a, Akimichi Takemura b, Ruriko Yoshida c a Department
More informationCourse 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra
Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra D. R. Wilkins Contents 3 Topics in Commutative Algebra 2 3.1 Rings and Fields......................... 2 3.2 Ideals...............................
More information4. Noether normalisation
4. Noether normalisation We shall say that a ring R is an affine ring (or affine k-algebra) if R is isomorphic to a polynomial ring over a field k with finitely many indeterminates modulo an ideal, i.e.,
More informationPacking of Rigid Spanning Subgraphs and Spanning Trees
Packing of Rigid Spanning Subgraphs and Spanning Trees Joseph Cheriyan Olivier Durand de Gevigney Zoltán Szigeti December 14, 2011 Abstract We prove that every 6k + 2l, 2k-connected simple graph contains
More informationarxiv: v2 [math.co] 30 Jun 2013
A polynomial representation and a unique code of a simple undirected graph arxiv:1304.5847v2 [math.co] 30 Jun 2013 Shamik Ghosh, Raibatak Sen Gupta, M. K. Sen Abstract In this note we introduce a representation
More informationDistance-reducing Markov bases for sampling from a discrete sample space
Bernoulli 11(5), 2005, 793 813 Distance-reducing Markov bases for sampling from a discrete sample space AKIMICHI TAKEMURA* and SATOSHI AOKI** Department of Mathematical Informatics, Graduate School of
More informationAlgebraic Statistics for a Directed Random Graph Model with Reciprocation
Algebraic Statistics for a Directed Random Graph Model with Reciprocation Sonja Petrović, Alessandro Rinaldo, and Stephen E. Fienberg Abstract. The p 1 model is a directed random graph model used to describe
More informationIncidence Structures Related to Difference Sets and Their Applications
aòµ 05B30 ü èµ Æ Òµ 113350 Æ Æ Ø Ø K8: 'u8'é(9ùa^ = Ø K8: Incidence Structures Related to Difference Sets and Their Applications úôœææ Æ Ø ž
More informationT-SPREAD STRONGLY STABLE MONOMIAL IDEALS
T-SPREAD STRONGLY STABLE MONOMIAL IDEALS VIVIANA ENE, JÜRGEN HERZOG, AYESHA ASLOOB QURESHI arxiv:1805.02368v2 [math.ac] 3 Jun 2018 Abstract. We introduce the concept of t-spread monomials and t-spread
More informationNUMERICAL MONOIDS (I)
Seminar Series in Mathematics: Algebra 2003, 1 8 NUMERICAL MONOIDS (I) Introduction The numerical monoids are simple to define and naturally appear in various parts of mathematics, e.g. as the values monoids
More informationarxiv: v1 [math.co] 13 May 2016
GENERALISED RAMSEY NUMBERS FOR TWO SETS OF CYCLES MIKAEL HANSSON arxiv:1605.04301v1 [math.co] 13 May 2016 Abstract. We determine several generalised Ramsey numbers for two sets Γ 1 and Γ 2 of cycles, in
More informationarxiv: v2 [math.ac] 24 Jun 2014
Hilbert-Samuel Multiplicity of a Bipartite Graph arxiv:1406.2603v2 [math.ac] 24 Jun 2014 Abstract Priya Das 1, Himadri Mukherjee IISER Kolkata, Mohanpur Campus Let G be a bipartite graph and I(G the toric
More informationarxiv: v2 [math.ac] 19 Dec 2008
A combinatorial description of monomial algebras arxiv:0810.4836v2 [math.ac] 19 Dec 2008 Ignacio Oeda Universidad de Extremadura Departamento de Matemáticas e-mail: oedamc@unex.es March 22, 2009 Abstract
More informationFast Polynomial Multiplication
Fast Polynomial Multiplication Marc Moreno Maza CS 9652, October 4, 2017 Plan Primitive roots of unity The discrete Fourier transform Convolution of polynomials The fast Fourier transform Fast convolution
More informationDIRECT SUM DECOMPOSABILITY OF POLYNOMIALS AND FACTORIZATION OF ASSOCIATED FORMS
DIRECT SUM DECOMPOSABILITY OF POLYNOMIALS AND FACTORIZATION OF ASSOCIATED FORMS MAKSYM FEDORCHUK Abstract. We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous
More informationToric Varieties in Statistics
Toric Varieties in Statistics Daniel Irving Bernstein and Seth Sullivant North Carolina State University dibernst@ncsu.edu http://www4.ncsu.edu/~dibernst/ http://arxiv.org/abs/50.063 http://arxiv.org/abs/508.0546
More informationNowhere-zero flows in signed series-parallel graphs arxiv: v1 [math.co] 6 Nov 2014
Nowhere-zero flows in signed series-parallel graphs arxiv:1411.1788v1 [math.co] 6 Nov 2014 Tomáš Kaiser 1,2 Edita Rollová 1,3 Abstract Bouchet conjectured in 1983 that each signed graph that admits a nowhere-zero
More informationDICKSON POLYNOMIALS OVER FINITE FIELDS. n n i. i ( a) i x n 2i. y, a = yn+1 a n+1 /y n+1
DICKSON POLYNOMIALS OVER FINITE FIELDS QIANG WANG AND JOSEPH L. YUCAS Abstract. In this paper we introduce the notion of Dickson polynomials of the k + 1)-th kind over finite fields F p m and study basic
More informationAlgorithmic Aspects of Gröbner Fans and Tropical Varieties
Algorithmic Aspects of Gröbner Fans and Tropical Varieties Anders Nedergaard Jensen Ph.D. Dissertation July 2007 Department of Mathematical Sciences Faculty of Science, University of Aarhus 2 Abstract
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationarxiv: v1 [math.ac] 31 Oct 2015
MESOPRIMARY DECOMPOSITION OF BINOMIAL SUBMODULES CHRISTOPHER O NEILL arxiv:1511.00161v1 [math.ac] 31 Oct 2015 Abstract. Recent results of Kahle and Miller give a method of constructing primary decompositions
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationAN ALGEBRAIC CHARACTERIZATION OF UNIQUELY VERTEX COLORABLE GRAPHS
AN ALGEBRAIC CHARACTERIZATION OF NIQELY VERTEX COLORABLE GRAPHS CHRISTOPHER J. HILLAR AND TROELS WINDFELDT Abstract. The study of graph vertex colorability from an algebraic perspective has introduced
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More informationRigid monomial ideals
Rigid monomial ideals Timothy B.P. Clark and Sonja Mapes February 10, 011 Abstract In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions
More informationarxiv: v4 [math.rt] 9 Jun 2017
ON TANGENT CONES OF SCHUBERT VARIETIES D FUCHS, A KIRILLOV, S MORIER-GENOUD, V OVSIENKO arxiv:1667846v4 [mathrt] 9 Jun 217 Abstract We consider tangent cones of Schubert varieties in the complete flag
More informationGroebner Bases, Toric Ideals and Integer Programming: An Application to Economics. Tan Tran Junior Major-Economics& Mathematics
Groebner Bases, Toric Ideals and Integer Programming: An Application to Economics Tan Tran Junior Major-Economics& Mathematics History Groebner bases were developed by Buchberger in 1965, who later named
More information4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN. Robin Thomas* Xingxing Yu**
4 CONNECTED PROJECTIVE-PLANAR GRAPHS ARE HAMILTONIAN Robin Thomas* Xingxing Yu** School of Mathematics Georgia Institute of Technology Atlanta, Georgia 30332, USA May 1991, revised 23 October 1993. Published
More information