The filling problem in the cube

DOI10.1007/s00454-015-9725-7zbMath1332.05159arXiv1202.5788OpenAlexW2199700296MaRDI QIDQ262301

Dominic Dotterrer

Publication date: 29 March 2016

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

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

zbMATH Keywords

isoperimetrycombinatorial geometry

Mathematics Subject Classification ID

Metric spaces, metrizability (54E35) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Unnamed Item
• A simpler proof of the Boros-Füredi-Bárány-Pach-Gromov theorem
• Singularities, expanders and topology of maps. II: From combinatorics to topology via algebraic isoperimetry
• On Gromov's method of selecting heavily covered points
• Homological connectivity of random 2-complexes
• Notes on Gromov's systolic estimate
• Filling Riemannian manifolds
• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• A note on the edges of the n-cube
• Evolution of the \(n\)-cube
• Normal and integral currents
• The optimal number of faces in cubical complexes
• Homological connectivity of random k -dimensional complexes
• COBOUNDARY EXPANDERS
• Maximally Connected Arrays on the n-Cube
• The number of s-dimensional faces in a complex: An analogy between the simplex and the cube
• Optimal Assignments of Numbers to Vertices

This page was built for publication: The filling problem in the cube