Related papers: Linear programming bounds for hyperbolic surfaces
A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…
Lienard systems are very important mathematical models describing oscillatory processes arising in applied sciences. In this paper, we study polynomial Lienard systems of arbitrary degree on the plane, and develop a new method to obtain a…
We introduce linear programs encoding regular expressions of finite languages. We show that, given a language, the optimum value of the associated linear program is a lower bound on the size of any regular expression of the language.…
We consider bounds on codes in spherical caps and related problems in geometry and coding theory. An extension of the Delsarte method is presented that relates upper bounds on the size of spherical codes to upper bounds on codes in caps.…
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…
This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…
In this paper, we study the problem of hyperball (hypersphere) packings in $n$-dimensional hyperbolic space ($n \ge 4$). We prove that to each $n$-dimensional congruent saturated hyperball packing, there is an algorithm to obtain a…
Using combinatorial arguments, we determine an upper bound on achievable rates of stabilizer codes used over the quantum erasure channel. This allows us to recover the no-cloning bound on the capacity of the quantum erasure channel, R is…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
An upper bound on the first S^1 invariant eigenvalue of the Laplacian for invariant metrics on the 2-sphere is used to find obstructions to the existence of isometric embeddings of such metrics in (R^3,can). As a corollary we prove: If the…
We obtain geometric lower bounds for the low Steklov eigenvalues of finite-volume hyperbolic surfaces with geodesic boundary. The bounds we obtain depend on the length of a shortest multi-geodesic disconnecting the surfaces into connected…
Packing problems in discrete geometry can be modeled as finding independent sets in infinite graphs where one is interested in independent sets which are as large as possible. For finite graphs one popular way to compute upper bounds for…
We show that a Kleinian surface group, or hyperbolic 3-manifold with a cusp-preserving homotopy-equivalence to a surface, has bounded geometry if and only if there is an upper bound on an associated collection of coefficients that depend…
The Lov\'{a}sz theta number is a semidefinite programming bound on the clique number of (the complement of) a given graph. Given a vertex-transitive graph, every vertex belongs to a maximal clique, and so one can instead apply this…
An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…
Let $S$ be a compact hyperbolic surface of genus $g\geq 2$ and let $I(S) = \frac{1}{\mathrm{Vol}(S)}\int_{S} \frac{1}{\mathrm{Inj}(x)^2 \wedge 1} dx$, where $\mathrm{Inj}(x)$ is the injectivity radius at $x$. We prove that for any $k\in…
In this paper, we establish a lower bound, in terms of the isoperimetric deficit, for the first eigenvalue of the Robin Laplacian with negative boundary parameter on horospherically convex bounded domains in the hyperbolic space. This…
We prove existence of thick geodesic triangulations of hyperbolic 3-manifolds and use this to prove existence of universal bounds on the principal curvatures of surfaces embedded in hyperbolic 3-manifolds.
We show that the number of simple closed geodesics of length bounded by L on a hyperbolic surface of genus g with c cusps and b boundary components grows roughly like L^{6g+2b+2c-6}. This has been conjectured for some time.
The paper is concerned with the maximization of Laplace eigenvalues on surfaces of given volume with a Riemannian metric in a fixed conformal class. A significant progress on this problem has been recently achieved by Nadirashvili-Sire and…