Related papers: Density bounds for unit ball packings relative to …
It is a well-known fact -- which can be shown by elementary calculus -- that the volume of the unit ball in $\mathbb{R}^n$ decays to zero and simultaneously gets concentrated on the thin shell near the boundary sphere as $n \nearrow…
It is well known that the lattice packing density and the lattice covering density of a triangle are $\frac{2}{3}$ and $\frac{3}{2}$ respectively. We also know that the lattices that attain these densities both are unique. Let…
We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform…
We give a complete characterization of all isoperimetric sets contained in a domain of the Euclidean plane, that is bounded by a Jordan curve and satisfies a no-neck property. Further, we prove that the isoperimetric profile of such domain…
In this paper we prove that given a volume, among all domains with smooth boundary in rank-1 symmetric spaces of noncompact type, geodesic balls maximizes the first nonzero Steklov eigenvalue. We also prove a comparison result for the first…
We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions,…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
This review describes the diversity of jammed configurations attainable by frictionless convex nonoverlapping (hard) particles in Euclidean spaces and for that purpose it stresses individual-packing geometric analysis. A fundamental feature…
The Kepler conjecture asserts that no packing of congruent balls in three-dimensional Euclidean space has density greater than that of the face-centered cubic packing. In 1998, Sam Ferguson and I announced a computer-assisted proof of this…
Let $M$ be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that $M$ is globally maximum if it is a maximum-length matching on all points. We say that $M$ is $k$-local maximum…
In quantum field theories, spectral densities are directly related to relevant physical observables. In Lattice QCD, their non-perturbative extraction from first principles requires the Inverse Laplace transform of Euclidean-time…
There exists a proper holomorphic mapping between balls of different dimensions such that it does not extend continuously to the boundary. The aim of this paper is to show the same phenomenon occurs for pseudoconvex domains of different…
We prove a fourth order analogue of the Saint-Venant inequality: the mean deflection of a clamped plate under uniform transverse load is maximal for the ball, among plates of prescribed volume in any dimension of space. The method works in…
We prove that kernel density estimation on symmetric spaces of non-compact type, whose L2-risk was bounded above in previous work (Asta,2021), in fact achieves a minimax rate of convergence. With this result, the story for kernel density…
Suppose one has a collection of disks of various sizes with disjoint interiors, a packing in the plane, and suppose the ratio of the smallest radius divided by the largest radius lies between $1$ and $q$. In his 1964 book Regular Figures…
This paper addresses congested transport, which can be described, at macroscopic scales, by a continuity equation with a pressure variable generated from the hard-congestion constraint (maximum value of the density). The main goal of the…
In this paper, we obtain optimal upper bounds for all the Neumann eigenvalues in two situations (that are closely related). First we consider a one-dimensional Sturm-Liouville eigenvalue problem where the density is a function $h(x)$ whose…
Nearly orthogonal lattices were formally defined in [4], where their applications to image compression were also discussed. The idea of ``near orthogonality" in $2$-dimensions goes back to the work of Gauss. In this paper, we focus on…
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…
We prove that, under some generic non-degeneracy assumptions, real analytic, centrally symmetric plane domains are determined by their Dirichlet (resp. Neumann) spectra. We prove that the conditions are open-dense for real analytic convex…