Many 2-level polytopes from matroids
From MaRDI portal
Publication:908212
DOI10.1007/S00454-015-9735-5zbMath1342.05021arXiv1409.2233OpenAlexW2240065239MaRDI QIDQ908212
Publication date: 3 February 2016
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.2233
Exact enumeration problems, generating functions (05A15) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52B99)
Related Items (5)
Bounds on the number of 2-level polytopes, cones, and configurations ⋮ Binary scalar products ⋮ Enumeration of 2-level polytopes ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes ⋮ Two-Level Polytopes with a Prescribed Facet
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Theta rank, levelness, and matroid minors
- Compressed polytopes and statistical disclosure limitation
- Triangulations. Structures for algorithms and applications
- On Kalai's conjectures concerning centrally symmetric polytopes
- Two poset polytopes
- Combinatorial geometries, convex polyhedra, and Schubert cells
- Constructions for projectively unique polytopes
- Geometric algorithms and combinatorial optimization.
- Coxeter matroids. With illustrations by Anna Borovik
- Face numbers of centrally symmetric polytopes produced from Split graphs
- Enumeration and limit laws for series-parallel graphs
- Theta Bodies for Polynomial Ideals
- Asymptotic Study of Subcritical Graph Classes
- Intersections of translates of convex bodies
- Singularity Analysis of Generating Functions
- Random Trees
- A Combinatorial Decomposition Theory
- On a certain class of polytopes associated with independence systems.
- Theory of Matroids
This page was built for publication: Many 2-level polytopes from matroids
