Related papers: Uniacute Spherical Codes

The surface code is a two-dimensional topological code with code parameters that scale optimally with the number of physical qubits, under the constraint of two-dimensional locality. In three spatial dimensions an analogous simple yet…

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…

Uniform bounds on sketched inner products of vectors or matrices underpin several important computational and statistical results in machine learning and randomized algorithms, including the Johnson-Lindenstrauss (J-L) lemma, the Restricted…

For a certain parametrized family of maps on the circle, with critical points and logarithmic singularities where derivatives blow up to infinity, a positive measure set of parameters was constructed in [19], corresponding to maps which…

Let $\mathbb F=\mathbb R$ or $\mathbb C$ and $n\in\b N$. Let $(S_k)_{k\ge0}$ be a time-homogeneous random walk on $GL_n(\b F)$ associated with an $U_n(\b F)$-biinvariant measure $\nu\in M^1(GL_n(\b F))$. We derive a central limit theorem…

Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…

A recent result by Parcet and Rogers is that finite order lacunarity characterizes the boundedness of the maximal averaging operator associated to an infinite set of directions in $\mathbb{R}^n$. Their proof is based on…

Our principal aim in the present article is to establish a uniform hybrid bound for individual values on the critical line of Hecke $L$-functions associated with cusp forms over the full modular group. This is rendered in the statement that…

Locally repairable codes enables fast repair of node failure in a distributed storage system. The code symbols in a codeword are stored in different storage nodes, such that a disk failure can be recovered by accessing a small fraction of…

For fixed positive integer $n$, $p\in[0,1]$, $a\in(0,1)$, we prove that if a function $g:\mathbb{S}^{n-1}\to \mathbb{R}$ is sufficiently close to 1, in the $C^a$ sense, then there exists a unique convex body $K$ whose $L_p$ curvature…

A cyclic subgroup $N$ of a finite group $G$ is called a uni-width subgroup of $G$ if $N$ is the unique cyclic subgroup of $G$ of order $|N|$. In this article, we prove that a finite group $G$ admits a unique largest uni-width subgroup…

We establish that unitarity of scattering amplitudes imposes universal entropy bounds. The maximal entropy of a self-sustained quantum field object of radius R is equal to its surface area and at the same time to the inverse running…

A recent conjecture of Caputo, Carlen, Lieb, and Loss, and, independently, of the author, states that the maximum of the permanent of a matrix whose rows are unit vectors in l_p is attained either for the identity matrix I or for a constant…

We propose a novel strategy to derive explicit and uniform upper bounds on the particle spectrum of six-dimensional gravitational theories with minimal supersymmetry, focusing initially on the tensor sector. The strategy is motivated by…

We study non-compact scaling limits of uniform random planar quadrangulations with a boundary when their size tends to infinity. Depending on the asymptotic behavior of the boundary size and the choice of the scaling factor, we observe…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…

Locally repairable codes which are optimal with respect to the bound presented by Prakash et al. are considered. New upper bounds on the length of such optimal codes are derived. The new bounds both improve and generalize previously known…

The contact number of a packing of finitely many balls in Euclidean $d$-space is the number of touching pairs of balls in the packing. A prominent subfamily of sphere packings is formed by the so-called totally separable sphere packings:…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…