Related papers: Universal bounds for spherical codes: the Levensht…
In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…
While it is often stated that the notion of electroweak (EW) naturalness in supersymmetric models is subjective, fuzzy and model-dependent, here we argue the contrary: electroweak naturalness can be elevated to a {\it principle} which is…
We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…
Interest has been directed recently towards low energy implications of a non-trivial conformal sector of an effective field theory with an IR fixed point (\Lambda), manifest in terms of ``unparticles'' with bizarre properties. We re-examine…
We describe a conjectural approach to obtaining canonical bases of the Hecke algebra at $q=1$ via continuous quadratic optimization. We focus on Specht modules $S^\lambda$ and proper cones inside $S^\lambda$ that are invariant under the…
We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…
In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of…
This article derives lower bounds on the supremal (strict) p-negative type of finite metric spaces using purely elementary techniques. The bounds depend only on the cardinality and the (scaled) diameter of the underlying finite metric…
We obtain Gaussian upper bounds for heat kernels of higher order differential operators with Dirichlet boundary conditions on bounded domains in $\R^N$. The bounds exhibit explicitly the nature of the spatial decay of the heat kernel close…
In this paper we present an extension of known semidefinite and linear programming upper bounds for spherical codes and consider a version of this bound for distance graphs. We apply the main result for the distance distribution of a…
In this paper we deal with lacunary and full versions of the spherical maximal function on the Heisenberg group $\mathbb{H}^n$, for $n\ge 2$. By suitable adaptation of an approach developed by M. Lacey in the Euclidean case, we obtain…
We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
Vector sets with optimal coherence according to the Welch bound cannot exist for all pairs of dimension and cardinality. If such an optimal vector set exists, it is an equiangular tight frame and represents the solution to a Grassmannian…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
For domains in $\mathbb{R}^d$, $d\geq 2$, we prove universal upper and lower bounds on the product of the bottom of the spectrum for the Laplacian to the power $p>0$ and the supremum over all starting points of the $p$-moments of the exit…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
Linear programming bounds provide an elegant method to prove optimality and uniqueness of an (n,N,t) spherical code. However, this method does not apply to the parameters (4,10,1/6). We use semidefinite programming bounds instead to show…
In the present article, we consider Algebraic Geometry codes on some rational surfaces. The estimate of the minimum distance is translated into a point counting problem on plane curves. This problem is solved by applying the upper bound…
Motivated by applications in DNA-based data storage, constrained codes have attracted a considerable amount of attention from both academia and industry. We study the maximum cardinality of constrained codes for which the constraints can be…