Related papers: Universal bounds for spherical codes: the Levensht…
In quantum theory on curved backgrounds, Heisenberg's uncertainty principle is usually discussed in terms of ensemble variances and flat-space commutators. Here we take a different, preparation-based viewpoint tailored to sharp position…
Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…
The Cohn-Elkies linear program for sphere packing, which was used to solve the 8 and 24 dimensional cases, is conjectured to not be sharp in any other dimension $d>2$. By mapping feasible points of this infinite-dimensional linear program…
We consider linear codes associated to Schubert varieties in Grassmannians. A formula for the minimum distance of these codes was conjectured in 2000 and after having been established in various special cases, it was proved in 2008 by…
We present a bottom-up approach to the question of supersymmetry breaking in the MSSM. Starting with the experimentally measurable low-energy supersymmetry breaking parameters, which can take any values consistent with present experimental…
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…
We compute the second and third levels of the Lasserre hierarchy for the spherical finite distance problem. A connection is used between invariants in representations of the orthogonal group and representations of the general linear group,…
In this paper, we consider the following non-linear equations in unbounded domains $\Omega$ with exterior Dirichlet condition: \begin{equation*}\begin{cases} (-\Delta)_p^s u(x)=f(u(x)), & x\in\Omega,\\ u(x)>0, &x\in\Omega,\\ u(x)\leq0,…
We present methods for bounding infinite-time averages in dynamical systems governed by nonlinear PDEs. The methods rely on auxiliary functionals, which are similar to Lyapunov functionals but satisfy different inequalities. The…
We prove optimal lower bounds for the growth of the energy over balls of minimizers to the vectorial Allen-Cahn energy in two spatial dimensions, as the radius tends to infinity. In the case of radially symmetric solutions, we can prove a…
One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…
We develop refinements of the Levenshtein bound in $q$-ary Hamming spaces by taking into account the discrete nature of the distances versus the continuous behavior of certain parameters used by Levenshtein. The first relevant cases are…
We use entropy numbers in combination with the polynomial method to derive a new general lower bound for the n-th minimal error in the quantum setting of information-based complexity. As an application, we improve some lower bounds on…
In an earlier work, the first author and Petsche solved an energy minimization problem for local fields and used the result to obtain lower bounds on the height of algebraic numbers all whose conjugates lie in various local fields, such as…
A \emph{covering array} is an $N \times k$ array of elements from a $v$-ary alphabet such that every $N \times t$ subarray contains all $v^t$ tuples from the alphabet of size $t$ at least $\lambda$ times; this is denoted as $\CA_\lambda(N;…
We estimate the distribution of relatively $r$-prime lattice points in number fields $K$ with their components having a norm less than $x$. In the previous paper we obtained uniform upper bounds as $K$ runs through all number fields under…
The uncertainty principle lemma for the Laplacian on Euclidean spaces shows the borderline-behavior of a potential for the following question : whether the Schr\"odinger operator has a finite or infinite number of the discrete pectrum. In…
Separating codes have their applications in collusion-secure fingerprinting for generic digital data, while they are also related to the other structures including hash family, intersection code and group testing. In this paper we study…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
For $q,n,d \in \mathbb{N}$, let $A_q^L(n,d)$ denote the maximum cardinality of a code $C \subseteq \mathbb{Z}_q^n$ with minimum Lee distance at least $d$, where $\mathbb{Z}_q$ denotes the cyclic group of order $q$. We consider a…