Related papers: Kissing number in hyperbolic space

We define and prove the existence of unique solutions of an asymptotic Plateau problem for spacelike maximal surfaces in the pseudo-hyperbolic space of signature (2, n): the boundary data is given by loops on the boundary at infinity of the…

In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\epsilon$-covering number of $\C([a, b]^d, B)$, in the $L_p$-metric, $1…

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 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…

We consider the problem of finding the maximum number $e_d(n)$ of pairs of touching circles in a packing of $n$ congruent circles of diameter $d$ in the hyperbolic plane of curvature $-1$. In the Euclidean plane, the maximum comes from a…

We use the Hardy spaces for Fourier integral operators to obtain bounds for spherical maximal functions in $L^{p}(\mathbb{R}^{n})$, $n\geq2$, where the radii of the spheres are restricted to a compact interval in $(0,\infty)$. These bounds…

In this paper, we investigate geometrical properties of the rank metric space and covering properties of rank metric codes. We first establish an analytical expression for the intersection of two balls with rank radii, and then derive an…

The density, denoted by $\kappa(n,r)$, of permutations having no cycles of length less than $r+1$ in a symmetric group $\mathrm{S}_n$ is explored. New asymptotic formulas for $\kappa(n,r)$ are obtained using the saddle-point method when…

In this paper, we prove uniform lower bounds on the volume growth of balls in the universal covers of Riemannian surfaces and graphs. More precisely, there exists a constant $\delta>0$ such that if $(M,hyp)$ is a closed hyperbolic surface…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

Let $f_n(k)$ be the number of subrings of index $k$ in $\mathbb{Z}^n$. We show that results of Brakenhoff imply a lower bound for the asymptotic growth of subrings in $\mathbb{Z}^n$, improving upon lower bounds given by Kaplan, Marcinek,…

For $t \in [-1, 1)$, a set of points on the $(n-1)$-dimensional unit sphere is called $t$-almost equiangular if among any three distinct points there is a pair with inner product $t$. We propose a semidefinite programming upper bound for…

Function field lattices are an interesting example of algebraically constructed lattices. Their minimum distance is bounded below by a function of the gonality of the underlying function field. Known explicit examples--coming mostly from…

In this article we investigate $L^p$ boundedness of the spherical maximal operator $\mathfrak{m}^\alpha$ of (complex) order $\alpha$ on the $n$-dimensional hyperbolic space $\mathbb{H}^n$, which was introduced and studied by El Kohen. We…

We show that for a very general and natural class of curvature functions, the problem of finding a complete strictly convex hypersurface satisfying f({\kappa}) = {\sigma} over (0,1) with a prescribed asymptotic boundary {\Gamma} at infinity…

In this paper we derive an explicit lower bound on the volume of a hyperbolic $n$-orbifold for dimensions greater than or equal to four. Our main tool is H. C. Wang's bound on the radius of a ball embedded in the fundamental domain of a…

For any positive integer r, let pi_{2r}(x) denote the number of prime pairs (p, p+2r) with p not exceeding (large) x. According to the prime-pair conjecture of Hardy and Littlewood, pi_{2r}(x) should be asymptotic to 2C_{2r}li_2(x) with an…

The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…

A space X is kappa-resolvable (resp. almost kappa-resolvable) if it contains kappa dense sets that are pairwise disjoint (resp. almost disjoint over the ideal of nowhere dense subsets of X). Answering a problem raised by Juhasz, Soukup, and…

The asymptotic rate vs. distance problem is a long-standing fundamental problem in coding theory. The best upper bound to date was given in 1977 and has received since then numerous proofs and interpretations. Here we provide a new,…