Combinatorial secant varieties

By Bernd Sturmfels, Seth Sullivant. 2005

91 citations recorded by the source corpus.

The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads to a commutative algebra version of the Strong Perfect Graph Theorem. Given any projective variety and any term order, we explore whether the initial ideal of the secant ideal coincides with the secant ideal of the initial ideal. For toric varieties, this leads to the notion of delightful triangulations of convex polytopes.

Subfields: Algebra and Number Theory, Computational Mathematics, Computational Theory and Mathematics

View Paper: https://www.semanticscholar.org/paper/911a73425e1306378511835298294ef910b98091

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Adam Van Tuyl
  2. Huy Tài Hà
  3. Christopher A. Francisco
  4. Giorgio Ottaviani
  5. K. Kimura
  6. Russ Woodroofe
  7. Arindam Banerjee
  8. Susan Morey

In Computational Mathematics

  1. Christopher A. Francisco
  2. Giorgio Ottaviani
  3. Adam Van Tuyl
  4. Huy Tài Hà
  5. Bruce Reznick
  6. Luca Chiantini
  7. Nick Vannieuwenhoven
  8. Jan Draisma

In Computational Theory and Mathematics

  1. Adam Van Tuyl
  2. Huy Tài Hà
  3. Christopher A. Francisco
  4. Giorgio Ottaviani
  5. K. Kimura
  6. Russ Woodroofe
  7. Susan Morey
  8. E. Emtander

Citations in the corpus