Related papers: Effective counting in sphere packings
We present the first systematic algorithm to estimate the maximum packing density of spheres when the grain sizes are drawn from an arbitrary size distribution. With an Apollonian filling rule, we implement our technique for disks in 2d and…
We derive quantitative volume constraints for sampling measures $\mu_t$ on the unit sphere $\mathbb{S}^d$ that satisfy Marcinkiewicz-Zygmund inequalities of order $t$. Using precise localization estimates for Jacobi polynomials, we obtain…
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,…
For positive integers $p$ and $q$ let $G:=\textrm{PSO}(p,q)$ be the projective indefinite special-orthogonal group of signature $(p,q)$. We study counting problems in the Riemannian symmetric space $X_G$ of $G$ and in the pseudo-Riemannian…
We consider two seemingly unconnected problems: first, under what circumstances are arithmetic groups like SL(2,O) generated by elementary matrices; second, when do certain classes of circle/sphere packings fill up space? We show that these…
We investigate, by "a la Marcinkiewicz" techniques applied to the (asymptotic) density function, how dense systems of equal spheres of $\rb^{n}, n \geq 1,$ can be partitioned at infinity in order to allow the computation of their density as…
In this article we consider a restricted orbital counting problem for the action of certain discrete groups on suitable spaces. In particular, we present asymptotics for counting those points in an orbit restricted to a single conjugacy…
We develop geometry-of-numbers methods to count orbits in coregular vector spaces having bounded invariants over any global field. We apply these techniques to bound the average ranks and determine average Selmer group sizes of elliptic…
We study the estimation, in Lp-norm, of density functions defined on [0,1]^d. We construct a new family of kernel density estimators that do not suffer from the so-called boundary bias problem and we propose a data-driven procedure based on…
We present a real-space spectral method for computing the orbital magnetization of crystals. Starting from the commutator form of the orbital magnetization operator, we formulate an energy-resolved spectral function that is amenable to…
A novel numerical approach to solving the shallow-water equations on the sphere using high-order numerical discretizations in both space and time is proposed. A space-time tensor formalism is used to express the equations of motion…
We prove a counting theorem concerning the number of lattice points for the dual lattices of weakly admissible lattices in an inhomogeneously expanding box, which generalises a counting theorem of Skriganov. The error term is expressed in…
We present an analytically explicit study of optimal discrete quantization on spherical geometries equipped with the geodesic metric, focusing on highly symmetric configurations on the unit sphere $\mathbb S^2$. Three discrete uniform…
We obtain algorithmically effective versions of the dense lattice sphere packings constructed from orders in $\mathbb{Q}$-division rings by the first author. The lattices in question are lifts of suitable codes from prime characteristic to…
This study aims to provide an analytical scheme for computing equilibrium configurations of relativistic stars by solving the Tolman-Oppenheimer-Volkoff equations directly in isotropic polar coordinates, as opposed to the commonly applied…
A collection of algorithms is described for numerically computing with smooth functions defined on the unit sphere. Functions are approximated to essentially machine precision by using a structure-preserving iterative variant of Gaussian…
Let $n, m\ge 2$. Let $\Gamma<\text{SO}^\circ(n+1,1)$ be a Zariski dense convex cocompact subgroup and $\Lambda\subset\mathbb{S}^n$ be its limit set. Let $\rho : \Gamma \to \text{SO}^\circ(m+1,1)$ be a Zariski dense convex cocompact faithful…
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton's kissing number. This notion has not only led to interesting mathematics, but has also found…
Many of the classic problems of coding theory are highly symmetric, which makes it easy to derive sphere-packing upper bounds and sphere-covering lower bounds on the size of codes. We discuss the generalizations of sphere-packing and…
K. Bezdek and Gy. Kiss showed that existence of origin-symmetric coverings of unit sphere in $\mathbb{E}^n$ by at most $2^n$ congruent spherical caps with radius not exceeding $\arccos\sqrt{\frac{n-1}{2n}}$ implies the $X$-ray conjecture…