Polyhedral Theory and Commutative Algebra

L. J. Billera
Additional contact information
L. J. Billera: Cornell University, School of Operations Research

A chapter in Mathematical Programming The State of the Art, 1983, pp 57-77 from Springer

Abstract: Abstract An expository account is presented describing the use of methods of commutative algebra to solve problems concerning the enumeration of faces of convex polytopes. Assuming only basic knowledge of vector spaces and polynomial rings, the enumeration theory of Stanley is developed to the point where one can see how the Upper Bound Theorem for spheres is proved. A briefer account is then given of the extension of these techniques which yielded the proof of the necessity of McMullen’s conjectured characterization of the f-vectors of convex polytopes. The latter account includes a glimpse of the application of these methods to the study of integer solutions to systems of linear inequalities.

Keywords: Simplicial Complex; Polynomial Ring; Commutative Algebra; Hilbert Series; Homogeneous Element (search for similar items in EconPapers)
Date: 1983
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-68874-4_3

Ordering information: This item can be ordered from
http://www.springer.com/9783642688744

DOI: 10.1007/978-3-642-68874-4_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().