English
Related papers

Related papers: Linear programming bounds for hyperbolic surfaces

200 papers

We study the number and the length of systoles on complete finite area orientable hyperbolic surfaces. In particular, we prove upper bounds on the number of systoles that a surface can have (the so-called kissing number for hyperbolic…

Geometric Topology · Mathematics 2016-01-27 Federica Fanoni , Hugo Parlier

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

Combinatorics · Mathematics 2020-07-14 Peter Boyvalenkov , Maya Stoyanova

The so-called {\it kissing number} for hyperbolic surfaces is the maximum number of homotopically distinct systoles a surface of given genus $g$ can have. These numbers, first studied (and named) by Schmutz Schaller by analogy with lattice…

Geometric Topology · Mathematics 2014-02-26 Hugo Parlier

We apply topological methods to study eigenvalues of the Laplacian on closed hyperbolic surfaces. For any closed hyperbolic surface $S$ of genus $g$, we get a geometric lower bound on ${\lambda_{2g-2}}(S)$: ${\lambda_{2g-2}}(S) > 1/4 +…

Spectral Theory · Mathematics 2017-03-08 Sugata Mondal

In this article we obtain linear programming bounds for the maximal sphere packing density of commutative spaces. A special case of our results solves a conjecture by Cohn and Zhao on linear programming bounds for sphere packings in…

Metric Geometry · Mathematics 2025-05-30 Maximilian Wackenhuth

Delsarte, Goethals, and Seidel (1977) used the linear programming method in order to find bounds for the size of spherical codes endowed with prescribed inner products between distinct points in the code. In this paper, we develop the…

Combinatorics · Mathematics 2015-07-16 Hiroshi Nozaki

We apply topological methods to study the smallest non-zero number $\lambda_1$ in the spectrum of the Laplacian on finite area hyperbolic surfaces. For closed hyperbolic surfaces of genus two we show that the set $\{S \in {\mathcal{M}_2}:…

Differential Geometry · Mathematics 2017-03-08 Sugata Mondal

We describe a new method for constraining Laplacian spectra of hyperbolic surfaces and 2-orbifolds. The main ingredient is consistency of the spectral decomposition of integrals of products of four automorphic forms. Using a combination of…

High Energy Physics - Theory · Physics 2024-01-23 Petr Kravchuk , Dalimil Mazac , Sridip Pal

We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…

Metric Geometry · Mathematics 2014-09-26 David de Laat , Fernando Mario de Oliveira Filho , Frank Vallentin

We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…

Metric Geometry · Mathematics 2021-04-21 Henry Cohn , Nicholas Triantafillou

The systole of a hyperbolic surface is bounded by a logarithmic function of its genus. This bound is sharp, in that there exist sequences of surfaces with genera tending to infinity that attain logarithmically large systoles. These are…

Geometric Topology · Mathematics 2015-12-22 Bram Petri , Alexander Walker

In this article we study the differences of two consecutive eigenvalues $\lambda_{i}-\lambda_{i-1}$ up to $i=2g-2$ for the Laplacian on hyperbolic surfaces of genus $g$, and show that the supremum of such spectral gaps over the moduli space…

Differential Geometry · Mathematics 2024-05-22 Yunhui Wu , Haohao Zhang , Xuwen Zhu

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…

Metric Geometry · Mathematics 2012-03-15 Henry Cohn , Noam Elkies

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…

Geometric Topology · Mathematics 2018-06-11 Jason DeBlois

In this paper we obtain a bound on the number of isometry classes of finite area hyperbolic surfaces which are length isospectral to a given surface depending only on the topological type of the surface and the length of the shortest closed…

Metric Geometry · Mathematics 2014-03-25 Weston Ungemach

Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…

Metric Geometry · Mathematics 2015-09-28 P. G. Boyvalenkov , P. D. Dragnev , D. P. Hardin , E. B. Saff , M. M. Stoyanova

We describe a method for constraining Laplacian and Dirac spectra of two dimensional compact orientable hyperbolic spin manifolds and orbifolds. The key ingredient is an infinite family of identities satisfied by the spectra. These spectral…

Spectral Theory · Mathematics 2023-11-23 Elliott Gesteau , Sridip Pal , David Simmons-Duffin , Yixin Xu

The goal of this work is to give new quantitative results about the distribution of semi-arithmetic hyperbolic surfaces in the moduli space of closed hyperbolic surfaces. We show that two coverings of genus $g$ of a fixed arithmetic surface…

Geometric Topology · Mathematics 2024-03-20 Cayo Dória , Nara Paiva

The first non-zero Laplace eigenvalue of a hyperbolic surface, or its spectral gap, measures how well-connected the surface is: surfaces with a large spectral gap are hard to cut in pieces, have a small diameter and fast mixing times. For…

Spectral Theory · Mathematics 2026-01-22 Laura Monk

We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…

Information Theory · Computer Science 2019-05-14 Alexander Barg , Dmitry Nogin
‹ Prev 1 2 3 10 Next ›