English
Related papers

Related papers: On sharp isoperimetric inequalities on the hypercu…

200 papers

An isoperimetric inequality on the Hamming cube for exponents $\beta\ge 0.50057$ is proved, achieving equality on any subcube. This was previously known for $\beta\ge \log_2(3/2)\approx 0.585$. Improved bounds are also obtained at the…

Classical Analysis and ODEs · Mathematics 2024-07-18 Polona Durcik , Paata Ivanisvili , Joris Roos

A sharp isoperimetric inequality for the Hamming cube is proved at the critical exponent $\beta=\frac12$. This follows up on previous work, where such bounds were established for $\beta$ near $\frac12$. As a consequence, this result settles…

Classical Analysis and ODEs · Mathematics 2026-02-25 Polona Durcik , Paata Ivanisvili , Joris Roos , Xinyuan Xie

Our basic result, an isoperimetric inequality for Hamming cube $Q_n$, can be written: \[ \int h_A^\beta d\mu \ge 2 \mu(A)(1-\mu(A)). \] Here $\mu$ is uniform measure on $V=\{0,1\}^n$ ($=V(Q_n)$); $\beta=\log_2(3/2)$; and, for $S\subseteq V$…

Combinatorics · Mathematics 2019-09-12 Jeff Kahn , Jinyoung Park

The `full' edge isoperimetric inequality for the discrete cube (due to Harper, Bernstein, Lindsay and Hart) specifies the minimum size of the edge boundary $\partial A$ of a set $A \subset \{0,1\}^n$, as a function of $|A|$. A weaker (but…

Combinatorics · Mathematics 2018-03-05 David Ellis , Nathan Keller , Noam Lifshitz

We give an alternative, simple method to prove isoperimetric inequalities over the hypercube. In particular, we show: 1. An elementary proof of classical isoperimetric inequalities of Talagrand, as well as a stronger isoperimetric result…

Combinatorics · Mathematics 2025-07-22 Ronen Eldan , Guy Kindler , Noam Lifshitz , Dor Minzer

Let $\mathscr{C}_n=\{-1,1\}^n$ be the discrete hypercube equipped with the uniform probability measure $\sigma_n$. We prove that if $(E,\|\cdot\|_E)$ is a Banach space of finite cotype and $p\in[1,\infty)$, then every function…

Functional Analysis · Mathematics 2024-02-21 Dario Cordero-Erausquin , Alexandros Eskenazis

We study isoperimetric inequalities on "slabs", namely weighted Riemannian manifolds obtained as the product of the uniform measure on a finite length interval with a codimension-one base. As our two main applications, we consider the case…

Differential Geometry · Mathematics 2025-10-14 Emanuel Milman

We prove an isoperimetric inequality for probability measures $\mu$ on $\mathbb{R}^n$ with density proportional to $\exp(-\phi(\lambda | x|))$, where $|x|$ is the euclidean norm on $\mathbb{R}^n$ and $\phi$ is a non-decreasing convex…

Probability · Mathematics 2009-02-27 Nolwen Huet

In this paper we prove an isoperimetric inequality for holomorphic functions in the unit polydisc $\mathbf U^n$. As a corollary we derive an inclusion relation between weighted Bergman and Hardy spaces of holomorphic functions in the…

Complex Variables · Mathematics 2014-03-04 Marijan Markovic

Let $\mathscr{C}_n=\{-1,1\}^n$ be the discrete hypercube equipped with the uniform probability measure $\sigma_n$. Talagrand's influence inequality (1994) asserts that there exists $C\in(0,\infty)$ such that for every $n\in\mathbb{N}$,…

Functional Analysis · Mathematics 2023-05-10 Dario Cordero-Erausquin , Alexandros Eskenazis

Let $\mathcal{M}\subset B(\mathcal{H})$ be a semifinite von Neumann algebra, where $B(\mathcal{H})$ denotes the algebra of all bounded linear operators on a Hilbert space $\mathcal{H}$, and let $\tau$ be a fixed faithful normal semifinite…

Functional Analysis · Mathematics 2026-02-03 Teng Zhang

We prove a vertex isoperimetric inequality for the $n$-dimensional Hamming ball $\mathcal{B}_n(R)$ of radius $R$. The isoperimetric inequality is sharp up to a constant factor for sets that are comparable to $\mathcal{B}_n(R)$ in size. A…

Combinatorics · Mathematics 2022-02-10 Zilin Jiang , Amir Yehudayoff

For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…

Combinatorics · Mathematics 2022-02-22 Cyrus Rashtchian , William Raynaud

The purpose of this paper is to analyze the isoperimetric inequality for symmetric log-convex probability measures on the line. Using geometric arguments we first re-prove that extremal sets in the isoperimetric inequality are intervals or…

Differential Geometry · Mathematics 2014-01-06 F. Feo , M. R. Posteraro , C. Roberto

We show that a set $A \subset \{0,1\}^{n}$ with edge-boundary of size at most $|A| (\log_{2}(2^{n}/|A|) + \epsilon)$ can be made into a subcube by at most $(2 \epsilon/\log_{2}(1/\epsilon))|A|$ additions and deletions, provided $\epsilon$…

Combinatorics · Mathematics 2013-11-28 David Ellis

Let $ m, n $ be integers such that $ \frac{n}{2} > m \geq 1 $ and let $ (M, g) $ be a closed $ n-$dimensional Riemannian manifold. We prove there exists some $ B \in \mathbb{R} $ depending only on $ (M, g) $, $ m $, and $ n $ such that for…

Analysis of PDEs · Mathematics 2024-09-16 Samuel Zeitler

We study the dimensional Brunn-Minkowski inequality for even log-concave probability measures $\mu$ on $\mathbb{R}^n$ via an analytic approach based on diffusion operators and gradient estimates. Our main result asserts that for every pair…

Metric Geometry · Mathematics 2026-05-05 Alexandros Eskenazis , Apostolos Giannopoulos , Natalia Tziotziou

We prove a Sobolev inequality which holds on submanifolds in Euclidean space of arbitrary dimension and codimension. This inequality is sharp if the codimension is at most 2. As a special case, we obtain a sharp isoperimetric inequality for…

Differential Geometry · Mathematics 2020-10-07 S. Brendle

In this paper we prove an isoperimetric inequality of euclidean type for complete metric spaces admitting a cone-type inequality. These include all Banach spaces and all complete, simply-connected metric spaces of non-positive curvature in…

Functional Analysis · Mathematics 2007-05-23 Stefan Wenger

We prove an inequality for functions on the discrete cube extending the edge-isoperimetric inequality for sets. This inequality turns out to be equivalent to the following claim about random walks on the cube: Subcubes maximize 'mean first…

Combinatorics · Mathematics 2012-07-06 Alex Samorodnitsky
‹ Prev 1 2 3 10 Next ›