English
Related papers

Related papers: A Periodic Isoperimetric Problem Related to the Un…

200 papers

Let $\Omega$ be a measurable Euclidean set in $\mathbb{R}^{n}$ that is symmetric, i.e. $\Omega=-\Omega$, such that $\Omega\times\mathbb{R}$ has the smallest Gaussian surface area among all measurable symmetric sets of fixed Gaussian volume.…

Probability · Mathematics 2022-04-27 Steven Heilman

In this paper, we disprove a conjecture of Goemans and Linial; namely, that every negative type metric embeds into $\ell_1$ with constant distortion. We show that for an arbitrarily small constant $\delta> 0$, for all large enough $n$,…

Computational Complexity · Computer Science 2013-05-21 Subhash A. Khot , Nisheeth K. Vishnoi

Let $\Omega\subset\mathbb{R}^{n+1}$ have minimal Gaussian surface area among all sets satisfying $\Omega=-\Omega$ with fixed Gaussian volume. Let $A=A_{x}$ be the second fundamental form of $\partial\Omega$ at $x$, i.e. $A$ is the matrix of…

Probability · Mathematics 2021-07-13 Steven Heilman

Consider the following two-player game on the edges of $K_n$, the complete graph with $n$ vertices: Starting with an empty graph $G$ on the vertex set of $K_n$, in each round the first player chooses $b \in \mathbb{N}$ edges from $K_n$…

Combinatorics · Mathematics 2022-07-07 Rajko Nenadov

The Small-Set Expansion Hypothesis (Raghavendra, Steurer, STOC 2010) is a natural hardness assumption concerning the problem of approximating the edge expansion of small sets in graphs. This hardness assumption is closely connected to the…

Computational Complexity · Computer Science 2010-11-12 Prasad Raghavendra , David Steurer , Madhur Tulsiani

Covering spaces of graphs have long been useful for studying expanders (as "graph lifts") and unique games (as the "label-extended graph"). In this paper we advocate for the thesis that there is a much deeper relationship between…

Computational Complexity · Computer Science 2018-03-20 Joshua A. Grochow , Jamie Tucker-Foltz

Let $\Omega$ be an open half-space or slab in $\mathbb{R}^{n+1}$ endowed with a perturbation of the Gaussian measure of the form $f(p):=\exp(\omega(p)-c|p|^2)$, where $c>0$ and $\omega$ is a smooth concave function depending only on the…

Differential Geometry · Mathematics 2014-11-14 César Rosales

Let $(M,g)$ be an $n$-dimensional asymptotically flat Riemannian manifold with nonnegative scalar curvature that admits a noncompact area-minimizing hypersurface $\Sigma \subset M$. In the case where $n = 3$, O. Chodosh and the first-named…

Differential Geometry · Mathematics 2025-06-12 Michael Eichmair , Thomas Koerber

Let $M$ be an $n\times n$ matrix with iid subgaussian entries with mean $0$ and variance $1$ and let $\sigma_n(M)$ denote the least singular value of $M$. We prove that \[\mathbb{P}\big( \sigma_{n}(M) \leq \varepsilon n^{-1/2} \big) =…

Probability · Mathematics 2025-01-09 Ashwin Sah , Julian Sahasrabudhe , Mehtaab Sawhney

In this paper we solve several reverse isoperimetric problems in the class of $\lambda$-convex bodies, i.e., convex bodies whose curvature at each point of their boundary is bounded below by some $\lambda > 0$. We give an affirmative answer…

Metric Geometry · Mathematics 2023-03-07 Kostiantyn Drach , Kateryna Tatarko

We solve a class of isoperimetric problems on $\mathbb{R}^2_+ :=\left\{ (x,y)\in \mathbb{R} ^2 : y>0 \right\}$ with respect to monomial weights. Let $\alpha $ and $\beta $ be real numbers such that $0\le \alpha <\beta+1$, $\beta\le 2…

Analysis of PDEs · Mathematics 2019-07-09 Angelo Alvino , Friedemann Brock , Francesco Chiacchio , Anna Mercaldo , Maria Rosaria Posteraro

In this note we improve a recent result by Arora, Khot, Kolla, Steurer, Tulsiani, and Vishnoi on solving the Unique Games problem on expanders. Given a $(1-\varepsilon)$-satisfiable instance of Unique Games with the constraint graph $G$,…

Data Structures and Algorithms · Computer Science 2009-03-03 Konstantin Makarychev , Yury Makarychev

For a set $A\subseteq Q_{n}=\left\{ 0,1\right\} ^{n}$ the $t$-neighbourhood of $A$ is $N^{t}\left(A\right)=\left\{ x\,:\,d\left(x,A\right)\leq t\right\}$, where $d$ denotes the usual graph distance on $Q_{n}$. Harper's vertex-isoperimetric…

Combinatorics · Mathematics 2019-10-24 Eero Raty

It is shown that $3$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with nearly minimum total Gaussian surface area must be close to adjacent $120$ degree sectors, when $n\geq2$. These same results hold for any…

Probability · Mathematics 2019-01-15 Steven Heilman

It is shown that $m$ disjoint sets with fixed Gaussian volumes that partition $\mathbb{R}^{n}$ with minimum Gaussian surface area must be $(m-1)$-dimensional. This follows from a second variation argument using infinitesimal translations.…

Functional Analysis · Mathematics 2021-07-13 Steven Heilman

We consider the problem $$ \epsilon^2 \Delta u-V(y)u+u^p\,=\,0,~~u>0~~\quad\mbox{in}\quad\Omega,~~\quad\frac {\partial u}{\partial \nu}\,=\,0\quad\mbox{on}~~~\partial \Omega, $$ where $\Omega$ is a bounded domain in $\mathbb R^2$ with…

Analysis of PDEs · Mathematics 2016-03-24 Suting Wei , Bin Xu , Jun Yang

We study the topology of (properly) immersed complete minimal surfaces $P^2$ in Hyperbolic and Euclidean spaces which have finite total extrinsic curvature, using some isoperimetric inequalities satisfied by the extrinsic balls in these…

Differential Geometry · Mathematics 2012-04-17 Vicent Gimeno , Vicente Palmer

We reduce the problem of proving a "Boolean Unique Games Conjecture" (with gap 1-delta vs. 1-C*delta, for any C> 1, and sufficiently small delta>0) to the problem of proving a PCP Theorem for a certain non-unique game. In a previous work,…

Computational Complexity · Computer Science 2021-07-09 Ronen Eldan , Dana Moshkovitz

In this paper, the author defines Generalized Unique Game Problem (GUGP), where weights of the edges are allowed to be negative. Two special types of GUGP are illuminated, GUGP-NWA, where the weights of all edges are negative, and…

Computational Complexity · Computer Science 2013-03-15 Peng Cui

A compact metric surface $M$ isometrically fills a closed metric curve $C$ if $\partial M=C$ and $d_M(x,y)=d_C(x,y)$ for every $x,y\in C=\partial M$; that is, $M$ does not introduce any ``shortcuts'' between points on its boundary. Gromov's…

Differential Geometry · Mathematics 2026-02-23 Joseph Briggs , Chris Wells
‹ Prev 1 2 3 10 Next ›