Related papers: Effective counting in sphere packings

We present a novel approach to measuring the expansion rate and the geometry of the Universe, which combine time-delay cosmography in lens galaxy clusters with pure samples of 'cosmic chronometers' (CCs) by probing the member galaxies. The…

In this article we study asymptotic properties of certain discrete groups $\Gamma$ acting by isometries on a product $\XX=\XX_1\times \XX_2$ of locally compact Hadamard spaces. The motivation comes from the fact that Kac-Moody groups over…

We view space-filling circle packings as subsets of the boundary of hyperbolic space subject to symmetry conditions based on a discrete group of isometries. This allows for the application of counting methods which admit rigorous upper and…

This paper deals with Riemannian optimization on the unit sphere in terms of $p$-norm with general $p > 1$. As a Riemannian submanifold of the Euclidean space, the geometry of the sphere with $p$-norm is investigated, and several geometric…

An orbit-like foliation is a singular foliation on a complete Riemannian manifold $M$ whose leaves are locally equidistant (i.e., a singular Riemannian foliation) and (transversely) infinitesimally homogenous. This class of singular…

The abundance of peaks in weak gravitational lensing maps is a potentially powerful cosmological tool, complementary to measurements of the shear power spectrum. We study peaks detected directly in shear maps, rather than convergence maps,…

We study a lattice point counting problem for spheres arising from the Heisenberg groups. In particular, we prove an upper bound on the number of points on and near large dilates of the unit spheres generated by the anisotropic norms…

Given a product X of locally compact rank one Hadamard spaces, we study asymptotic properties of certain discrete isometry groups. First we give a detailed description of the structure of the geometric limit set and relate it to the limit…

We introduce a novel strategy for cosmological Boltzmann codes leading to an increase in speed by a factor of \sim 30 for small scale Fourier modes. We (re-)investigate the tight coupling approximation and obtain analytic formulae reaching…

Approximate integer programming is the following: For a convex body $K \subseteq \mathbb{R}^n$, either determine whether $K \cap \mathbb{Z}^n$ is empty, or find an integer point in the convex body scaled by $2$ from its center of gravity…

The quantization problem looks for best approximations of a probability measure on a given metric space by finitely many points, where the approximation error is measured with respect to the Wasserstein distance. On particular smooth…

Let $\rho:\Gamma\rightarrow PSL_d(\mathbb{K})$ be a Zariski dense Borel-Anosov representation, for $\mathbb{K}$ equal to $\mathbb{R}$ or $\mathbb{C}$. Let $o$ be a form of signature $(p,d-p)$ on $\mathbb{K}^d$ (where $0<p<d)$. Let…

The spherical cap discrepancy is a widely used measure for how uniformly a sample of points on the sphere is distributed. Being hard to compute, this discrepancy measure is typically replaced by some lower or upper estimates when designing…

We use measurements from the South Pole Telescope (SPT) Sunyaev Zel'dovich (SZ) cluster survey in combination with X-ray measurements to constrain cosmological parameters. We present a statistical method that fits for the scaling relations…

Polarization skyrmions are usually characterized through a unit Stokes vector field, which defines a map from the transverse plane to the Poincar\'e (Bloch) sphere and allows one to assign a skyrmion number under appropriate boundary…

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

We establish omega results for the divisor and circle problems that are conjecturally sharp, while also determining the sign of the large values obtained. This improves on the work of Soundararajan and on the subsequent independent…

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a…

We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…

We prove sharp inequalities of Hardy type for functions in the Sobolev space $W^{1,p}$ on the unit sphere $\mathbb{S}^{n-1}$ in $\mathbb{R}^{n}$. We achieve this in both the subcritical and critical cases. The method we use to show…