Equivalence classes of full-dimensional 0/1-polytopes with many vertices

DOI10.1007/S00454-014-9630-5zbMath1306.05006arXiv1101.0410OpenAlexW1988073754MaRDI QIDQ2514226

Peter L. Guo, William Y. C. Chen

Publication date: 3 February 2015

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.0410

zbMATH Keywords

symmetryhyperplanePólya theoryfull-dimensional 0/1-polytope

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05)

Uses Software

• 01poly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A simple and relatively efficient triangulation of the n-cube
• Extremal properties of \(0/1\)-polytopes
• Derangements on the \(n\)-cube
• All 0-1 polytopes are traveling salesman polytopes
• Upper bounds on the maximal number of facets of 0/1-polytopes
• Revlex-initial 0/1-polytopes
• Induced Cycle Structures of the Hyperoctahedral Group
• What is known about unit cubes
• Classifying Hyperplanes in Hypercubes
• On the cycle index of a product of permutation groups
• On 0-1 polytopes with many facets

This page was built for publication: Equivalence classes of full-dimensional 0/1-polytopes with many vertices