Related papers: Euclidean Partitions Optimizing Noise Stability

We prove a vector-valued inequality for the Gaussian noise stability (i.e. we prove a vector-valued Borell inequality) for Euclidean functions taking values in the two-dimensional sphere, for all correlation parameters at most $1/10$ in…

We study the Gaussian noise stability of subsets A of Euclidean space satisfying A=-A. It is shown that an interval centered at the origin, or its complement, maximizes noise stability for small correlation, among symmetric subsets of the…

We consider the model introduced by Bilu and Linial (2010), who study problems for which the optimal clustering does not change when distances are perturbed. They show that even when a problem is NP-hard, it is sometimes possible to obtain…

It is shown that every measurable partition ${A_1,..., A_k}$ of $\mathbb{R}^3$ satisfies $$\sum_{i=1}^k||\int_{A_i} xe^{-\frac12||x||_2^2}dx||_2^2\le 9\pi^2.\qquad(*)$$ Let ${P_1,P_2,P_3}$ be the partition of $\mathbb{R}^2$ into $120^\circ$…

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

We study clustering through the partitions it induces on a finite labeled set $[n]=\{1,\dots,n\}$, and analyze how these partitions change under perturbations of a point configuration $X=(x_1,\dots,x_n)\in(\mathbb{R}^d)^n$. We equip the…

We propose some new mixed finite element methods for the time dependent stochastic Stokes equations with multiplicative noise, which use the Helmholtz decomposition of the driving multiplicative noise. It is known [16] that the pressure…

Let $S$ be a set of $n$ points in $\mathbb{R}^d$. A Steiner convex partition is a tiling of ${\rm conv}(S)$ with empty convex bodies. For every integer $d$, we show that $S$ admits a Steiner convex partition with at most $\lceil…

Necessary and sufficient conditions of uniform consistency are explored. A hypothesis is simple. Nonparametric sets of alternatives are bounded convex sets in $\mathbb{L}_p$, $p >1$ with "small" balls deleted. The "small" balls have the…

We prove a generalization of the hyperplane inequality for intersection bodies, where volume is replaced by an arbitrary measure $\mu$ with even continuous density and sections are of arbitrary dimension $n-k,\ 1\le k <n.$ If $K$ is a…

The Majority is Stablest Theorem has numerous applications in hardness of approximation and social choice theory. We give a new proof of the Majority is Stablest Theorem by induction on the dimension of the discrete cube. Unlike the…

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

Deterministic chaotic dynamics presumes that the state space can be partitioned arbitrarily finely. In a physical system, the inevitable presence of some noise sets a finite limit to the finest possible resolution that can be attained. Much…

We solve a long-standing open problem about the optimal codebook structure of codes in $n$-dimensional Euclidean space that consist of $n+1$ codewords subject to a codeword energy constraint, in terms of minimizing the average decoding…

In recent years a great deal of attention has been paid to discretizations of the incompressible Stokes equations that exactly preserve the incompressibility constraint. These are of substantial interest because these discretizations are…

In this article, we consider the stochastic wave equation in spatial dimension $d=1$, with linear term $\sigma(u)=u$ multiplying the noise. This equation is driven by a Gaussian noise which is white in time and fractional in space with…

For positive integers $s$ and $L \geq 3$, Berkovich and Uncu (Ann. Comb. $23$ ($2019$) $263$--$284$) conjectured an inequality between the sizes of two closely related sets of partitions whose parts lie in the interval $\{s, \ldots, L+s\}$.…

Let $k$ be a field. Then Gaussian elimination over $k$ and the Euclidean division algorithm for the univariate polynomial ring $k[x]$ allow us to write any matrix in $SL_n(k)$ or $SL_n(k[x])$, $n\geq 2$, as a product of elementary matrices.…

We consider composite-composite testing problems for the expectation in the Gaussian sequence model where the null hypothesis corresponds to a convex subset $\mathcal{C}$ of $\mathbb{R}^d$. We adopt a minimax point of view and our primary…

We establish the Gaussian Multi-Bubble Conjecture: the least Gaussian-weighted perimeter way to decompose $\mathbb{R}^n$ into $q$ cells of prescribed (positive) Gaussian measure when $2 \leq q \leq n+1$, is to use a "simplicial cluster",…