Jump to content

Combinatorial commutative algebra

From Wikipedia, the free encyclopedia

Combinatorial commutative algebra is a relatively new, rapidly developing mathematical discipline. As the name implies, it lies at the intersection of two more established fields, commutative algebra and combinatorics, and frequently uses methods of one to address problems arising in the other. Less obviously, polyhedral geometry plays a significant role.

One of the milestones in the development of the subject was Richard Stanley's 1975 proof of the Upper Bound Conjecture for simplicial spheres, which was based on earlier work of Melvin Hochster and Gerald Reisner. While the problem can be formulated purely in geometric terms, the methods of the proof drew on commutative algebra techniques.

A signature theorem in combinatorial commutative algebra is the characterization of h-vectors of simplicial polytopes conjectured in 1970 by Peter McMullen. Known as the g-theorem, it was proved in 1979 by Stanley (necessity of the conditions, algebraic argument) and by Louis Billera and Carl W. Lee (sufficiency, combinatorial and geometric construction). A major open question was the extension of this characterization from simplicial polytopes to simplicial spheres, the g-conjecture, which was resolved in 2018 by Karim Adiprasito.

Important notions of combinatorial commutative algebra

[edit]

See also

[edit]

References

[edit]

A foundational paper on Stanley–Reisner complexes by one of the pioneers of the theory:

  • Hochster, Melvin (1977). "Cohen–Macaulay rings, combinatorics, and simplicial complexes". Ring Theory II: Proceedings of the Second Oklahoma Conference. Lecture Notes in Pure and Applied Mathematics. Vol. 26. Dekker. pp. 171–223. ISBN 0-8247-6575-3. OCLC 610144046. Zbl 0351.13009.

The first book is a classic (first edition published in 1983):

Very influential, and well written, textbook-monograph:

Additional reading:

A recent addition to the growing literature in the field, contains exposition of current research topics: