Abstract:We give an introduction to the theory of determinantal ideals and rings, their Gröbner bases, initial ideals and algebras, respectively. The approach is based on the straightening law and the Knuth-Robinson-Schensted correspondence. The article contains a section treating the basic results about the passage to initial ideals and algebras.
“…We use the following notations and facts from Gröbner bases theory, see for example [5]. Consider the polynomial ring S = k[x 1 , .…”
Section: Gröbner Basesmentioning
confidence: 99%
“…By [9, Thm. 1.16 (5)] the family of Cartwright-Sturmfels ideals is closed under any multigraded linear section. Hence it is enough to prove the statement for the ideal (f e + m e : e ∈ E).…”
Section: (D)mentioning
confidence: 99%
“…Let X gen G be the 6 × 6 matrix associated to the graph from Example 3.2(3). That is, in the 6 × 6 generic matrix we set to 0 the entries in positions (1, 1), (1,2), (1,3), (1,4), (2, 1), (2, 2), (3, 2), (3, 3), (4, 3), (4, 4), (5, 1), (5,4).…”
Motivated by questions in algebra and combinatorics we study two ideals associated to a simple graph G:• the Lovász-Saks-Schrijver ideal defining the d-dimensional orthogonal representations of the graph complementary to G and • the determinantal ideal of the (d + 1)-minors of a generic symmetric matrix with 0s in positions prescribed by the graph G. In characteristic 0 these two ideals turn out to be closely related and algebraic properties such as being radical, prime or a complete intersection transfer from the Lovász-Saks-Schrijver ideal to the determinantal ideal. For Lovász-Saks-Schrijver ideals we link these properties to combinatorial properties of G and show that they always hold for d large enough. For specific classes of graphs, such a forests, we can give a complete picture and classify the radical, prime and complete intersection Lovász-Saks-Schrijver ideals.
“…We use the following notations and facts from Gröbner bases theory, see for example [5]. Consider the polynomial ring S = k[x 1 , .…”
Section: Gröbner Basesmentioning
confidence: 99%
“…By [9, Thm. 1.16 (5)] the family of Cartwright-Sturmfels ideals is closed under any multigraded linear section. Hence it is enough to prove the statement for the ideal (f e + m e : e ∈ E).…”
Section: (D)mentioning
confidence: 99%
“…Let X gen G be the 6 × 6 matrix associated to the graph from Example 3.2(3). That is, in the 6 × 6 generic matrix we set to 0 the entries in positions (1, 1), (1,2), (1,3), (1,4), (2, 1), (2, 2), (3, 2), (3, 3), (4, 3), (4, 4), (5, 1), (5,4).…”
Motivated by questions in algebra and combinatorics we study two ideals associated to a simple graph G:• the Lovász-Saks-Schrijver ideal defining the d-dimensional orthogonal representations of the graph complementary to G and • the determinantal ideal of the (d + 1)-minors of a generic symmetric matrix with 0s in positions prescribed by the graph G. In characteristic 0 these two ideals turn out to be closely related and algebraic properties such as being radical, prime or a complete intersection transfer from the Lovász-Saks-Schrijver ideal to the determinantal ideal. For Lovász-Saks-Schrijver ideals we link these properties to combinatorial properties of G and show that they always hold for d large enough. For specific classes of graphs, such a forests, we can give a complete picture and classify the radical, prime and complete intersection Lovász-Saks-Schrijver ideals.
“…In this case the ideal Q generated by the Plücker relations is a complete intersection ideal of height 6 and Q = J 2 (3, 4) ∩ P where P is a prime ideal generated by Q and (S 2 ) (3,3|3,3) . In fact, there is an automorphism of S 2 (3, 4) carrying J 2 (3,4) into P so that S 2 (3, 4)/P ∼ = A 2 (3,4). Furthermore for t = 2, m = 3, n = 5 the ideal of quadrics in J 2 (3, 5) generate an ideal whose codimension is smaller than that of J 2 (3, 5) itself.…”
Section: Highest Bi-weight Vectors Of Odd Cubicsmentioning
confidence: 99%
“…a term order such that in Proof. We know that A t is Cohen-Macaulay by [4,Theorem 7.10] and has dimension mn by [8,Proposition 10.16] because we have excluded the cases listed in Remark 1.2. Therefore we have reg(A t ) = dim A t + a(A t ) = mn + a(A t ).…”
Section: Castelnuovo-mumford Regularity Of a Tmentioning
ABSTRACT. It is well-known that the Plücker relations generate the ideal of relations of the maximal minors of a generic m × n matrix. In this paper we discuss the relations of t-minors for t < min(m, n). We will exhibit minimal relations in degrees 2 (non-Plücker in general) and 3, and give some evidence for our conjecture that we have found the generating system of the ideal of relations. The approach is through the representation theory of the general linear group.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.