Minimal triangulation of the 4-cube

DOI10.1016/0012-365X(82)90185-6MaRDI QIDQ1163235zbMATH OpenFDO

Authors R. W. Cottle

Publication date 1982

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Polytopes and polyhedra (52Bxx)

Cites work

• scientific article; zbMATH DE number 3204642 (Why is no real title available?)
• A triangulation of the n-cube
• Observations on a class of nasty linear complementarity problems
• Triangulations for the cube

Cited in

(16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1163235)