Minimal triangulation of the 4-cube

DOI10.1016/0012-365X(82)90185-6zbMath0483.52005MaRDI QIDQ1163235

Richard W. Cottle

Publication date: 1982

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

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Related Items (15)

Identification of piecewise affine models in noisy environment ⋮ A Lower Bound Technique for Triangulations of Simplotopes ⋮ A triangulation of the n-cube ⋮ A note on minimal triangulations of an n-cube ⋮ A control problem for affine dynamical systems on a full-dimensional polytope. ⋮ A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes ⋮ On \(0/1\)-polytopes with nonobtuse triangulations ⋮ Minimum-cardinality triangulations of the \(d\)-cube for \(d=5\) and \(d=6\) ⋮ Some computational methods for systems of nonlinear equations and systems of polynomial equations ⋮ Lower bounds for the simplexity of the \(n\)-cube ⋮ The Middle-Cut Triangulations of the n-Cube ⋮ Convex envelopes for edge-concave functions ⋮ Simplexity of the cube ⋮ A note on triangulating the 5-cube ⋮ A simple and relatively efficient triangulation of the n-cube

Cites Work

• Unnamed Item
• Observations on a class of nasty linear complementarity problems
• A triangulation of the n-cube
• Triangulations for the cube

This page was built for publication: Minimal triangulation of the 4-cube