Related papers: The local quantization behavior of absolutely cont…

Suppose $1 < p < \infty$. Carleson's Theorem states that the Fourier series of any function in $L^p[-\pi, \pi]$ converges almost everywhere. We show that the Schnorr random points are precisely those that satisfy this theorem for every $f…

Let $P$ be a polynomial of degree $d$ in independent Bernoulli random variables which has zero mean and unit variance. The Bonami hypercontractivity bound implies that the probability that $|P| > t$ decays exponentially in $t^{2/d}$.…

This paper proves optimal tradeoffs between the locality and parameters of quantum error-correcting codes. Quantum codes give a promising avenue towards quantum fault tolerance, but the practical constraint of locality limits their quality.…

Let $\mathcal{L}$ be a fixed $d$-dimensional lattice. We study the localization properties of solutions of the stationary Schr\"odinger equation with a positive $L^\infty$ potential on tori $\mathbb{R}^d/L\mathcal{L}$ in the limit, as…

By computational optimization of air-void cavities in metallic substrates, we show that the local density of states (LDOS) can reach within a factor of $\approx 10$ of recent theoretical upper limits, and within a factor $\approx 4$ for the…

Centroidal Voronoi tessellations (CVTs) are Voronoi tessellations of a region such that the generating points of the tessellations are also the centroids of the corresponding Voronoi regions with respect to a given probability measure. CVT…

The local number variance associated with a spherical sampling window of radius $R$ enables a classification of many-particle systems in $d$-dimensional Euclidean space according to the degree to which large-scale density fluctuations are…

We study logarithmic Voronoi cells for linear statistical models and partial linear models. The logarithmic Voronoi cells at points on such model are polytopes. To any $d$-dimensional linear model inside the probability simplex…

Interactive proof systems whose verifiers are constant-space machines have interesting features that do not have counterparts in the better studied case where the verifiers operate under reasonably large space bounds. The language…

We prove a couple of results on local continuous extension of proper holomorphic maps $F:D \rightarrow \Omega$, $D, \Omega \varsubsetneq \mathbb{C}^n$, making local assumptions on $\partial{D}$ and $\partial{\Omega}$. The first result…

A local algorithm is a distributed algorithm where each node must operate solely based on the information that was available at system startup within a constant-size neighbourhood of the node. We study the applicability of local algorithms…

Let $A$ be a central quantization of an affine Poisson variety $X$ over a field of characteristic $p>0.$ We show that the completion of $A$ with respect to a closed point $y\in X$ is isomorphic to the tensor product of the Weyl algebra with…

We introduce the notion of localized topological pressure for continuous maps on compact metric spaces. The localized pressure of a continuous potential $\varphi$ is computed by considering only those $(n,\epsilon)$-separated sets whose…

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

We study percolation in the following random environment: let $Z$ be a Poisson process of constant intensity in the plane, and form the Voronoi tessellation of the plane with respect to $Z$. Colour each Voronoi cell black with probability…

This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…

Locally repairable codes (LRCs) play a crucial role in mitigating data loss in large-scale distributed and cloud storage systems. This paper establishes a unified decomposition theorem for general optimal $(r,\delta)$-LRCs. Based on this,…

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal…

We study Voronoi cells in the statistical setting by considering preimages of the maximum likelihood estimator that tessellate an open probability simplex. In general, logarithmic Voronoi cells are convex sets. However, for certain…

In this paper, we first consider a flat plate (called a lamina) with uniform density $\rho$ that occupies a region $\mathfrak R$ of the plane. We show that the location of the center of mass, also known as the centroid, of the region equals…