On the Borsuk and Grünbaum problems for (0,1)- and (-1,0,1)-polytopes in low-dimensional spaces

DOI10.1134/S1064562413010092zbMATH Open1279.52006MaRDI QIDQ352177FDOQ352177

Authors V. B. Goldshteyn

Publication date 4 July 2013

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

Borsuk's conjectureGrünbaum problem

Mathematics Subject Classification ID

Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Extremal set theory (05D05) Other problems of combinatorial convexity (52A37)

Recommendations

• The problems of Borsuk and Grunbaum on lattice polytopes
• Around Borsuk's hypothesis
• The Borsuk problem for some classes of \((0,1)\)-polytopes
• scientific article; zbMATH DE number 718861
• Some old and new problems in combinatorial geometry. I: Around Borsuk's problem

Cites work

• scientific article; zbMATH DE number 5935733 (Why is no real title available?)
• scientific article; zbMATH DE number 177380 (Why is no real title available?)
• scientific article; zbMATH DE number 1775058 (Why is no real title available?)
• A counterexample to Borsuk’s conjecture
• Drei Sätze über die n-dimensionale euklidische Sphäre
• Research Problems in Discrete Geometry

Cited in

(10)

• Borsuk's problem for \((0,1)\)-polytopes and cross-polytopes
• The Borsuk problem for some classes of \((0,1)\)-polytopes
• scientific article; zbMATH DE number 1775058 (Why is no real title available?)
• On the multiple Borsuk numbers of sets
• Maximal sets of given diameter in the grid and the torus
• Block partitions: an extended view
• The Borsuk problem for \((0,1)\)-polyhedra and cross polytopes.
• On a probabilistic aspect of the Grünbaum problem
• Borsuk's partition conjecture
• The problems of Borsuk and Grunbaum on lattice polytopes

This page was built for publication: On the Borsuk and Grünbaum problems for \((0,1)\)- and \((-1,0,1)\)-polytopes in low-dimensional spaces

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