Combinatorial symbolic powers

By Seth Sullivant. 2006

70 citations recorded by the source corpus.

Abstract Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph and its blowups. As a result, perfect graphs play an important role in the theory, dual to the role played by perfect graphs in the theory of secants of monomial ideals. We use Grobner degenerations as a tool to reduce questions about symbolic powers of arbitrary ideals to the monomial case. Among the applications are a new, unified approach to the Grobner bases of symbolic powers of determinantal and Pfaffian ideals.

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

View Paper: https://www.semanticscholar.org/paper/396cc7e44b4572a201463ef4c25391a09817e937

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. Huy Tài Hà
  2. Adam Van Tuyl
  3. Luis N'unez-Betancourt
  4. Jack Jeffries
  5. Holger Brenner
  6. K. Kimura
  7. Russ Woodroofe
  8. Arindam Banerjee

In Computational Theory and Mathematics

  1. Adam Van Tuyl
  2. Huy Tài Hà
  3. Luis N'unez-Betancourt
  4. Jack Jeffries
  5. Holger Brenner
  6. K. Kimura
  7. Russ Woodroofe
  8. E. Emtander

In Geometry and Topology

  1. Adam Van Tuyl
  2. Huy Tài Hà
  3. Luis N'unez-Betancourt
  4. Jack Jeffries
  5. Holger Brenner
  6. K. Kimura
  7. Russ Woodroofe
  8. Arindam Banerjee

Citations in the corpus