English
Related papers

Related papers: Almost isoperimetric subsets of the discrete cube

200 papers

Given any $f$ a locally finitely piecewise affine homeomorphism of $\Omega \subset \mathbb{R}^d$ onto $\Delta \subset \mathbb{R}^d$ (for $d=3, 4$) such that $f\in W^{1,p}(\Omega, \mathbb{R}^d)$ and $f^{-1}\in W^{1,q}(\Delta, \mathbb{R}^d)$,…

Analysis of PDEs · Mathematics 2025-10-08 Daniel Campbell , Luigi D'Onofrio , Tomáš Vítek

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

We study independent long-range percolation on $\mathbb{Z}^d$ where the vertices $x$ and $y$ are connected with probability $1-e^{-\beta\|x-y\|^{-d-\alpha}}$ for $\alpha > 0$. Provided the critical exponents $\delta$ and $2-\eta$ defined by…

Probability · Mathematics 2024-10-15 Johannes Bäumler , Noam Berger

We show that 1. for every $A\subseteq \{0, 1\}^n$, there exists a polytope $P\subseteq \mathbb{R}^n$ with $P \cap \{0, 1\}^n = A$ and extension complexity $O(2^{n/2})$, 2. there exists an $A\subseteq \{0, 1\}^n$ such that the extension…

Computational Geometry · Computer Science 2021-05-26 Pavel Hrubeš , Navid Talebanfard

Let $M$ be an $n$-dimensional Alexandrov space with curvature $\geq 1$, and let $\{q_1,\cdots,q_k\}$ be any $\frac\pi2$-separated subset in $M$ (i.e. the distance $|q_iq_j|\geq\frac{\pi}{2}$ for any $i\neq j$). Under the additional…

Differential Geometry · Mathematics 2014-03-24 Xiaole Su , Hongwei Sun , Yusheng Wang

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, and let $\varepsilon,\psi \in (0,1)$ be parameters. Here, we consider the task of constructing a $(1+\varepsilon)$-spanner for $P$, where every edge might fail (independently) with…

Computational Geometry · Computer Science 2025-02-19 Sariel Har-Peled , Maria C. Lusardi

We study the intersection statistics of affine subspaces in the hypercube $\mathbb{F}_2^n$, motivated by recent work of Alon, Axenovich, and Goldwasser on the intersection statistics of axis-aligned subcubes of an $n$-dimensional cube. Let…

Combinatorics · Mathematics 2026-04-16 Zixuan Xu

We find the optimal constant $C$ such that \begin{equation*} \|f_1*f_2*\dots*f_{k}\|_{\infty}\geq C\prod_{i=1}^{k}\|f_i\|_1 \end{equation*} for functions $f_i:\{0,1\}^d\to\mathbb{R}$. As applications, we derive bounds for Sidon sets on…

Classical Analysis and ODEs · Mathematics 2025-12-23 José Gaitan , José Madrid

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

Combinatorics · Mathematics 2026-05-28 Domonkos Czifra , Ákos Dúcz , Máté Matolcsi , Dániel Varga , Pál Zsámboki

We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group $G$ has edge density close to the expected one on every induced subgraph of size at least $\log^c |G|$, for any fixed $c > 1$ and $|G|$…

Combinatorics · Mathematics 2017-10-24 Sergei Konyagin , Ilya D. Shkredov

For a subset A of a finite abelian group G we define Sigma(A)={sum_{a\in B}a:B\subset A}. In the case that Sigma(A) has trivial stabiliser, one may deduce that the size of Sigma(A) is at least quadratic in |A|; the bound |Sigma(A)|>=…

Number Theory · Mathematics 2015-05-13 Simon Griffiths

We study the size blow-up that is necessary to convert an algebraic circuit of product-depth $\Delta+1$ to one of product-depth $\Delta$ in the multilinear setting. We show that for every positive $\Delta = \Delta(n) = o(\log n/\log \log…

Computational Complexity · Computer Science 2018-04-10 Suryajith Chillara , Christian Engels , Nutan Limaye , Srikanth Srinivasan

We show that for each $n \geq 2$, the systoles of closed hyperbolic $n$-manifolds form a dense subset of $(0, +\infty)$. We also show that for any $n\geq 2$ and any Salem number $\lambda$, there is a closed arithmetic hyperbolic…

Geometric Topology · Mathematics 2024-11-13 Sami Douba , Junzhi Huang

We present a simple deterministic distributed $(2+\epsilon)$-approximation algorithm for minimum weight vertex cover, which completes in $O(\log{\Delta}/\epsilon\log\log{\Delta})$ rounds, where $\Delta$ is the maximum degree in the graph,…

Distributed, Parallel, and Cluster Computing · Computer Science 2016-02-15 Reuven Bar-Yehuda , Keren Censor-Hillel , Gregory Schwartzman

In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…

Metric Geometry · Mathematics 2012-12-27 Alexey Glazyrin

We study spanners in planar domains, including polygonal domains, polyhedral terrain, and planar metrics. Previous work showed that for any constant $\epsilon\in (0,1)$, one could construct a $(2+\epsilon)$-spanner with $O(n\log(n))$ edges…

Computational Geometry · Computer Science 2024-04-09 Sujoy Bhore , Balázs Keszegh , Andrey Kupavskii , Hung Le , Alexandre Louvet , Dömötör Pálvölgyi , Csaba D. Tóth

We deduce, as a consequence of the arithmetic removal lemma, an almost-all version of the Balog-Szemer\'{e}di-Gowers theorem: For any $K\geq 1$ and $\varepsilon > 0$, there exists $\delta = \delta(K,\varepsilon)>0$ such that the following…

Combinatorics · Mathematics 2019-09-09 Xuancheng Shao

We seek discrete approximations to solutions $u:\Omega \to R$ of semilinear elliptic partial differential equations of the form $\Delta u + f_s(u) = 0$, where $f_s$ is a one-parameter family of nonlinear functions and $\Omega$ is a domain…

Pattern Formation and Solitons · Physics 2013-01-31 John M. Neuberger , Nandor Sieben , James W. Swift

In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…

Analysis of PDEs · Mathematics 2019-05-27 Filomena Pacella , Giulio Tralli

A $(\beta,\epsilon)$-$\textit{hopset}$ is, informally, a weighted edge set that, when added to a graph, allows one to get from point $a$ to point $b$ using a path with at most $\beta$ edges ("hops") and length…

Data Structures and Algorithms · Computer Science 2017-05-02 Shang-En Huang , Seth Pettie
‹ Prev 1 4 5 6 7 8 10 Next ›