Generic graph construction ideals and Greene ’ s theorem

@inproceedings{Bruns1999GenericGC,
  title={Generic graph construction ideals and Greene ’ s theorem},
  author={Winfried Bruns and Michaĺ Kwieciński},
  year={1999}
}
Let X be anm × n matrix of indeterminates, m ≤ n, andT a new indeterminate. Consider the polynomial rings R0 = K[X] andR = R0[T ]. For a given positive integer t ≤ m, consider the ideal It = It(X) generated by thet-minors (i. e. the determinants of the t× t submatrices) of X. Using all these determinantal ideals, we define a new ideal J in R = R0[T ], which we call thegeneric graph construction ideal , as follows: 

From This Paper

Topics from this paper.
3 Citations
22 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Gr̈ obner bases and Stanley decompositions of determinantal rings

  • B. Sturmfels
  • Math. Z.205, 137–144
  • 1990
Highly Influential
4 Excerpts

Longest increasing and decreasing subsequences

  • C. Schensted
  • Can. J. Math. 13, 179– 191
  • 1961
Highly Influential
5 Excerpts

rationality of determinantal rings and their Rees rings

  • W. Bruns, F A.Conca.
  • Mich. Math. J.45,
  • 1998
Highly Influential
4 Excerpts

Gr öbner bases and multiplicity of determinantal and pfaffian ideals

  • J. Herzog, N. V. Trung
  • Adv. Math.96, 1–37
  • 1992
Highly Influential
3 Excerpts

Determinantal rings. (Lect

  • W. Bruns, U. Vetter
  • Notes Math.,
  • 1988
Highly Influential
3 Excerpts

Sagbi bases and application to blow-up algebras

  • A. Conca, J. Herzog, G. Valla
  • J. Reine Angew. Math. 474, 113–138
  • 1996
1 Excerpt

Commutative algebra with a view towards algebraic geometry

  • D. Eisenbud
  • 1995
2 Excerpts

MacPherson’s Graph Construction

  • M. Kwiecínski
  • Sinan Sert öz: Algebraic Geometry
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…