English
Related papers

Related papers: On a biased edge isoperimetric inequality for the …

200 papers

We prove the following stability version of the edge isoperimetric inequality for the cube: any subset of the cube with average boundary degree within $K$ of the minimum possible is $\varepsilon $-close to a union of $L$ disjoint cubes,…

Combinatorics · Mathematics 2017-03-30 Peter Keevash , Eoin Long

The edge isoperimetric inequality in the discrete cube specifies, for each pair of integers $m$ and $n$, the minimum size $g_n(m)$ of the edge boundary of an $m$-element subset of $\{0,1\}^{n}$; the extremal families (up to automorphisms of…

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

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

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

We prove a stability version of Harper's cube vertex isoperimetric inequality, showing that subsets of the cube with vertex boundary close to the minimum possible are close to (generalised) Hamming balls. Furthermore, we obtain a local…

Combinatorics · Mathematics 2018-07-26 Peter Keevash , Eoin Long

The relative isoperimetric inequality inside an open, convex cone $\mathcal C$ states that, at fixed volume, $B_r \cap \mathcal C$ minimizes the perimeter inside $\mathcal C$. Starting from the observation that this result can be recovered…

Analysis of PDEs · Mathematics 2012-10-12 Alessio Figalli , Emanuel Indrei

In this short note, we establish an edge-isoperimetric inequality for arbitrary product graphs. Our inequality is sharp for subsets of many different sizes in every product graph. In particular, it implies that the $2^d$-element sets with…

Combinatorics · Mathematics 2024-11-19 Sahar Diskin , Wojciech Samotij

We prove the sharp isoperimetric inequality $$ \mathbb{E} \,h_{A}^{\log_{2}(3/2)} \geq \mu(A)^{*} (\log_{2}(1/\mu(A)^{*}))^{\log_{2}(3/2)} $$ for all sets $A \subseteq \{0,1\}^n$, where $\mu$ denotes the uniform probability measure,…

Classical Analysis and ODEs · Mathematics 2023-03-15 David Beltran , Paata Ivanisvili , José Madrid

In this paper, we prove a $p$-Hardy inequality on the discrete half-line with weights $n^{\alpha}$ for all real $p > 1$. Building on the work of Miclo for $p = 2$ and Muckenhoupt in the continuous settings, we develop a quantitative…

Functional Analysis · Mathematics 2025-01-03 Ali Barki

The normalised volume measure on the $\ell_p^n$ unit ball ($1\leq p\leq 2$) satisfies the following isoperimetric inequality: the boundary measure of a set of measure $a$ is at least $cn^{1/p}\tilde{a}\log^{1-1/p}(1/\tilde{a})$, where…

Probability · Mathematics 2008-05-27 Sasha Sodin

We show that for all $A, B \subseteq \{0,1,2\}^{d}$ we have $$ |A+B|\geq (|A||B|)^{\log(5)/(2\log(3))}. $$ We also show that for all finite $A,B \subset \mathbb{Z}^{d}$, and any $V \subseteq\{0,1\}^{d}$ the inequality $$ |A+B+V|\geq…

Combinatorics · Mathematics 2024-04-16 Lars Becker , Paata Ivanisvili , Dmitry Krachun , Jóse Madrid

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

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

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 weak maximum principle of the isoparametric finite element method is proved for the Poisson equation under the Dirichlet boundary condition in a (possibly concave) curvilinear polyhedral domain with edge openings smaller than $\pi$,…

Numerical Analysis · Mathematics 2023-03-17 Buyang Li , Weifeng Qiu , Yupei Xie , Wenshan Yu

The discrete isoperimetric inequality states that among all n -gons with a fixed area, the regular n -gon has the least perimeter. We prove analogues of the discrete isoperimetric inequality (involving circumradius or inradius) for cyclic…

Geometric Topology · Mathematics 2025-04-08 Subash Chandra Behera , Shiv Parsad

We prove an isoperimetric inequality for conjugation-invariant sets of size $k$ in $S_n$, showing that these necessarily have edge-boundary considerably larger than some other sets of size $k$ (provided $k$ is small). Specifically, let…

Combinatorics · Mathematics 2014-10-30 Neta Atzmon , David Ellis , Dmitry Kogan

Harper's Theorem states that, in a hypercube, among all sets of a given fixed size the Hamming balls have minimal closed neighbourhoods. In this paper we prove a stability-like result for Harper's Theorem: if the closed neighbourhood of a…

Combinatorics · Mathematics 2019-10-17 Michał Przykucki , Alexander Roberts

We show that certain statements related to the Fourier-Walsh expansion of functions with respect to a biased measure on the discrete cube can be deduced from the respective results for the uniform measure by a simple reduction. In…

Combinatorics · Mathematics 2010-11-25 Nathan Keller

It is well known that isoperimetric inequalities imply in a very general measure-metric-space setting appropriate concentration inequalities. The former bound the boundary measure of sets as a function of their measure, whereas the latter…

Differential Geometry · Mathematics 2019-12-19 Emanuel Milman
‹ Prev 1 2 3 10 Next ›