The filling problem in the cube

DOI10.1007/S00454-015-9725-7MaRDI QIDQ262301zbMATH OpenOpenAlexFDO

Authors 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

combinatorial geometryisoperimetry

Mathematics Subject Classification ID

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

Abstract: We prove an isoperimetric inequality for filling cellular cycles in a high dimensional cube with cellular chains. In addition, we provide a family of cubical cellular cycles for which the exponent in the inequality is optimal.

Recommendations

• scientific article; zbMATH DE number 3948286
• FILLING A CUBE WITH SUBSEQUENCES OF BOXES
• Combinatorial higher dimensional isoperimetry and divergence
• A short proof of Gromov's filling inequality
• scientific article; zbMATH DE number 3841903

Cites work

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

Cited in

(1)

• scientific article; zbMATH DE number 4120174 (Why is no real title available?)

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

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