Related papers: Universal bounds for spherical codes: the Levensht…
The purpose of this paper is to study the existence of weak solutions for some classes of one-parameter subelliptic gradient-type systems involving a Sobolev-Hardy potential defined on an unbounded domain $\Omega_\psi$ of the Heisenberg…
The purpose of this paper is to introduce techniques of obtaining optimal ways to determine a d-level quantum state or distinguish such states. It entails designing constrained elementary measurements extracted from maximal abelian subsets…
We provide a sphere-packing lower bound for the optimal error probability in finite blocklengths when coding over a symmetric classical-quantum channel. Our result shows that the pre-factor can be significantly improved from the order of…
The method of potential envelopes is used to analyse the bound-state spectrum of the Schroedinger Hamiltonian H = -Delta -v/(r+b), where v and b are positive. We established simple formulas yielding upper and lower energy bounds for all the…
The free energy of the Random Energy Model at the transition point between ferromagnetic and spin glass phases is calculated. At this point, equivalent to the decoding error threshold in optimal codes, free energy has finite size…
We use the Hardy spaces for Fourier integral operators to obtain bounds for spherical maximal functions in $L^{p}(\mathbb{R}^{n})$, $n\geq2$, where the radii of the spheres are restricted to a compact interval in $(0,\infty)$. These bounds…
We derive logarithmic gradient estimate and universal boundedness estimate for semilinear elliptic equations on \RCD\, metric measure spaces, which contains the class of Riemannian manifolds with Ricci curvature bounded below. These…
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…
Energy bounds which are uniform in the background metric are obtained from upper bounds for entropy-like quantities. The argument is based on auxiliary Monge-Amp\`ere equations involving sublevel sets, and bypasses the…
In his study of finite (Vassiliev's) knot invariants,Vogel introduced the so-called universal parameters, belonging to the projective plane, which particularly parameterize the simple Lie algebras by the Vogel's table. Subsequently a number…
The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…
The sum-rank metric provides a unifying framework that generalizes both the celebrated Hamming and rank metrics, and has found applications in areas such as network coding, distributed storage, and space-time coding. A central problem is to…
Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert--Varshamov lower bound on the…
Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…
We derive a lower bound to the spectral threshold of the Dirichlet Laplacian in tubular neighbourhoods of constant radius about complete surfaces. This lower bound is given by the lowest eigenvalue of a one-dimensional operator depending on…
As a generalization of equiangular lines, equiangular subspaces were first systematically studied by Balla, Dr\"{a}xler, Keevash and Sudakov in 2017. In this paper, we extend their work to $s$-distance subspaces, i.e., to sets of…
A Martin-L\"of test $\mathcal U$ is universal if it captures all non-Martin-L\"of random sequences, and it is optimal if for every ML-test $\mathcal V$ there is a $c \in \omega$ such that $\forall n(\mathcal{V}_{n+c} \subseteq…
We develop an analogue for sphere packing of the linear programming bounds for error-correcting codes, and use it to prove upper bounds for the density of sphere packings, which are the best bounds known at least for dimensions 4 through…
Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for…
Naturalness bounds on weak scale supersymmetry in the context of radiative breaking of the electro-weak symmetry are analyzed. In the case of minimal supergravity it is found that for low tan\beta and for low values of fine tuning Phi,…