A general method to determine limiting optimal shapes for edge-isoperimetric inequalities

zbMath1355.05175arXiv1608.06373MaRDI QIDQ510340

Ellen Veomett, Emmanuel Tsukerman

Publication date: 17 February 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

latticesinfinite graphscontinuous isoperimetric problemdiscrete isoperimetric problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Infinite graphs (05C63)

Related Items

Isoperimetry in integer lattices

Uses Software

• polymake
• SageMath

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex isoperimetric inequalities for a family of graphs on \(\mathbb{Z}^k\)
• Sharp \(N^{3/4}\) law for the minimizers of the edge-isoperimetric problem on the triangular lattice
• Isoperimetric inequalities and fractional set systems
• Edge-isoperimetric inequalities in the grid
• The edge-isoperimetric problem for discrete tori
• Edge-Isoperimetric Problem for Cayley Graphs and Generalized Takagi Functions
• An Ordering on the Even Discrete Torus
• Assignment of Numbers to Vertices
• The Brunn-Minkowski inequality
• Brunn-Minkowski Theory and Cauchy’s Surface Area Formula
• An Isoperimetric Inequality on the Discrete Torus
• An Inequality for Functions on the Hamming Cube
• Convex Bodies The Brunn-MinkowskiTheory
• Edge-Isoperimetric Inequalities and Influences
• Optimal numberings and isoperimetric problems on graphs