Related papers: Effective counting in sphere packings

We develop the affine sieve in the context of orbits of congruence subgroups of semi-simple groups acting linearly on affine space. In particular we give effective bounds for the saturation numbers for points on such orbits at which the…

Let $G$ be a connected semisimple real algebraic group, and $\Gamma<G$ be a Zariski dense Anosov subgroup with respect to a minimal parabolic subgroup. We describe the asymptotic behavior of matrix coefficients $\langle (\exp tv). f_1,…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…

Zador's celebrated theorem is a cornerstone of optimal quantisation, establishing both the weak limit of the empirical distribution of an $n$-point optimal quantiser in $R^d$ and the decay rate of the associated $L_s$-mean quantisation…

We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augmented bins of height $1+\gamma$, for some arbitrarily small…

For a geometrically finite group Gamma of G=SO(n,1), we survey recent developments on counting and equidistribution problems for orbits of Gamma in a homogeneous space H\G where H is trivial, symmetric or horospherical. Main applications…

We propose fast, exact and efficient algorithms for the convolution of two arbitrary functions on the sphere which speed up computations by a factor \order{\sqrt{N}} compared to present methods where $N$ is the number of pixels. No…

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…

We develop the notion of a Kleinian Sphere Packing, a generalization of "crystallographic" (Apollonian-like) sphere packings defined by Kontorovich-Nakamura [KN19]. Unlike crystallographic packings, Kleinian packings exist in all…

Fast and precise propagation of satellite orbits is required for mission design, orbit determination and payload data analysis. We present a method to improve the computational performance of numerical propagators and simultaneously…

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 estimate on a compact interval densities with isolated irregularities, such as discontinuities or discontinuities in some derivatives. From independent and identically distributed observations we construct a kernel estimator with…

Let $H < G$ both be noncompact connected semisimple real algebraic groups where the former is maximal proper and $\Gamma < G$ be a lattice. Building on the work of Gorodnik-Weiss, we refine their techniques and obtain effective results.…

We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean limit. We axiomatize key properties of sphere packing bounds…

Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…

We use a dictionary between lattice point counting inside dilated d-dimensional ellipsoids (Euclidean counting) and counting of lifts of a closed horosphere that intersect a ball of increasing radius, to obtain two types of results.…

We present new splitting methods designed for the numerical integration of near-integrable Hamiltonian systems, and in particular for planetary N-body problems, when one is interested in very accurate results over a large time span. We…

Let $\Lambda$ be a subgroup of an arithmetic lattice in SO(n+1,1). The quotient $\mathbb{H}^{n+1} / \Lambda$ has a natural family of congruence covers corresponding to primes in some ring of integers. We establish a super-strong…

In this article we consider the general setting of conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We deal with two classes of such systems: attracting and parabolic. The latter being…