Pith. sign in

REVIEW 1 cited by

Geometric stability via information theory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1510.00258 v4 pith:GG2QEDWV submitted 2015-09-29 math.MG cs.ITmath.COmath.IT

classification math.MGcs.ITmath.COmath.IT
keywords inequalitystabilitybodyclosealonebestboundconstant
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The Loomis-Whitney inequality, and the more general Uniform Cover inequality, bound the volume of a body in terms of a product of the volumes of lower-dimensional projections of the body. In this paper, we prove stability versions of these inequalities, showing that when they are close to being tight, the body in question is close in symmetric difference to a 'box'. Our results are best possible up to a constant factor depending upon the dimension alone. Our approach is information theoretic. We use our stability result for the Loomis-Whitney inequality to obtain a stability result for the edge-isoperimetric inequality in the infinite $d$-dimensional lattice. Namely, we prove that a subset of $\mathbb{Z}^d$ with small edge-boundary must be close in symmetric difference to a $d$-dimensional cube. Our bound is, again, best possible up to a constant factor depending upon $d$ alone.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The Endpoint Cardinality of Discrete Cube Skeleta

    math.CO 2026-07 accept novelty 7.0 of 10

    For each fixed 0≤k<n, the minimum lattice set containing a filled k-skeleton about every one of N centers is Θ(N^{1-(n-k)/(2n^2)}), closing the endpoint lower bound.

Pith tools