Complexity yardsticks for \(f\)-vectors of polytopes and spheres

DOI10.1007/s00454-019-00138-2zbMath1456.52014arXiv1908.09628OpenAlexW2980197407WikidataQ127151159 ScholiaQ127151159MaRDI QIDQ2197688

Eran Nevo

Publication date: 1 September 2020

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

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

zbMATH Keywords

computational complexity\(f\)-vectorpolytopeflag \(f\)-vector\(CW\)-sphere

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Inequalities and extremum problems involving convexity in convex geometry (52A40) Polytopes and polyhedra (52Bxx)

Related Items

Embedding divisor and semi-prime testability in \(f\)-vectors of polytopes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the generalized lower bound conjecture for polytopes and spheres
• Squarefree \( P\)-modules and the \({\mathbf {cd}}\)-index
• Rigidity and the lower bound theorem. I
• A new basis of polytopes
• Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets
• The number of faces of a simplicial convex polytope
• A proof of the sufficiency of McMullen's conditions for f-vectors of simplicial convex polytopes
• NP-complete decision problems for binary quadratics
• Flag \(f\)-vectors and the \(cd\)-index
• The extended f-vectors of 4-polytopes
• Combinatorics and commutative algebra.
• Monotonicity of the cd-index for polytopes
• Semi-algebraic sets of \(f\)-vectors
• The numbers of faces of simplicial polytopes
• A proof of the lower bound conjecture for convex polytopes
• Projected products of polygons
• The flag $f$-vectors of Gorenstein* order complexes of dimension $3$
• The cd-index of fans and posets
• A generalized lower‐bound conjecture for simplicial polytopes