Related papers: Linear programming bounds for hyperbolic surfaces
Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions.…
We present two constructions, both inspired by ideas from graph theory, of sequences random surfaces of growing area, whose systoles grow logarithmically as a function of their area. This also allows us to prove a new lower bound on the…
We prove an upper bound for the number of shortest closed geodesics in a closed hyperbolic manifold of any dimension in terms of its volume and systole, generalizing a theorem of Parlier for surfaces. We also obtain bounds on the number of…
The kissing number in n-dimensional Euclidean space is the maximal number of non-overlapping unit spheres which simultaneously can touch a central unit sphere. Bachoc and Vallentin developed a method to find upper bounds for the kissing…
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…
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular,…
We carry out a numerical study of the spinless modular bootstrap for conformal field theories with current algebra $U(1)^c \times U(1)^c$, or equivalently the linear programming bound for sphere packing in $2c$ dimensions. We give a more…
In this paper we examine the geometry of minimal surfaces of arithmetic hyperbolic 3-manifolds. In particular, we give bounds on the totally geodesic 2-systole, construct infinitely many incommensurable manifolds with the same initial…
Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that…
For hyperbolic surfaces with geodesic boundary, we study the orthosystole, i.e. the length of a shortest essential arc from the boundary to the boundary. We recover and extend work by Bavard completely characterizing the surfaces maximizing…
We study topological lower bounds on the number of small Laplacian eigenvalues on hyperbolic surfaces. We show there exist constants $a,b>0$ such that when $(g+1)<a\frac{n}{\log n}$, any hyperbolic surface of genus-$g$ with $n$ cusps has at…
We study the systole of a random surface, where by a random surface we mean a surface constructed by randomly gluing together an even number of triangles. We study two types of metrics on these surfaces, the first one coming from using…
We present an extension of the Delsarte linear programming method. For several dimensions it yields improved upper bounds for kissing numbers and for spherical codes. Musin's recent work on kissing numbers in dimensions three and four can…
In this work, we obtain the first upper bound on the multiplicity of Laplacian eigenvalues for negatively curved surfaces which is sublinear in the genus g. Our proof relies on a trace argument for the heat kernel, and on the idea of…
This article presents some methods to control the bottom of the spectrum of the Laplacian $\lambda_0$ on hyperbolic surfaces with infinite volume. Our first result bounds the $\lambda_0$ of a geometrically finite surface in terms of the…
In this paper, we study spectral gaps of closed hyperbolic surfaces for large genus. We show that for any fixed $k\geq 1$, as the genus goes to infinity, the maximum of $\lambda_k-\lambda_{k-1}$ over any thick part of the moduli space of…
More than thirty years ago, Brooks and Buser-Sarnak constructed sequences of closed hyperbolic surfaces with logarithmic systolic growth in the genus. Recently, Liu and Petri showed that such logarithmic systolic lower bound holds for every…
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a truncation radius for the three-point function. As a result, we…
We constrain the low-energy spectra of Laplace operators on closed hyperbolic manifolds and orbifolds in three dimensions, including the standard Laplace-Beltrami operator on functions and the Laplacian on powers of the cotangent bundle.…
Our main result is that for all sufficiently large $x_0>0$, the set of commensurability classes of arithmetic hyperbolic 2- or 3-orbifolds with fixed invariant trace field $k$ and systole bounded below by $x_0$ has density one within the…