Combinatorial Polytope Enumeration

Details Combinatorial Polytope Enumeration Combinatorial Polytope Enumeration

2009-08-12

arxiv.org/abs/0908.1619v1

Mathematics

Combinatorics

Scientific paper

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies repeated cutting planes and planar sweeps to a d-simplex. Our generator has implications for several outstanding problems in polytope theory, including conjectures about the number of distinct polytopes, the edge expansion of polytopal graphs, and the d-step conjecture.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Polytope Enumeration does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Polytope Enumeration, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Polytope Enumeration will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-370070