Lower bounds for the simplexity of the \(n\)-cube

DOI10.1016/j.disc.2012.09.002zbMath1263.52009arXiv0910.4200OpenAlexW1994734319MaRDI QIDQ1759408

Alexey Glazyrin

Publication date: 20 November 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Bernstein polynomial\(n\)-cubesimplicial triangulation0/1-matrixprismoidsimplicial dissection

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Computational aspects related to convexity (52B55)

Related Items

Properties of the multidimensional finite elements ⋮ Nearly orthogonal vectors and small antipodal spherical codes

Cites Work

• Unnamed Item
• Unnamed Item
• A simple and relatively efficient triangulation of the n-cube
• On simplicial partitions of polytopes
• A triangulation of the n-cube
• Minimal triangulation of the 4-cube
• A note on minimal triangulations of an n-cube
• Extensions of Lemke's algorithm for the linear complementarity problem
• Triangulations for the cube
• Lower bounds on cube simplexity
• Asymptotically efficient triangulations of the \(d\)-cube
• Minimal simplicial dissections and triangulations of convex 3-polytopes
• Simplexity of the cube
• A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
• Lower bounds for simplicial covers and triangulations of cubes
• Lectures on Polytopes
• What is known about unit cubes