相关论文: A computer verification of the Kepler conjecture

G. Fejes T\'oth posed the following problem: Determine the infimum of the densities of the lattices of closed balls in $\bR^n$ such that each affine $k$-subspace $(0 \le k \le n-1)$ of $\bR^n$ intersects some ball of the lattice. We give a…

Let the kissing number $K(d)$ be the maximum number of non-overlapping unit balls in $\mathbb R^d$ that can touch a given unit ball. Determining or estimating the number $K(d)$ has a long history, with the value of $K(3)$ being the subject…

We consider the online problem of packing circles into a square container. A sequence of circles has to be packed one at a time, without knowledge of the following incoming circles and without moving previously packed circles. We present an…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We investigate the asymptotic best approximation of a smooth, strictly convex body $K$ in $\mathbb{R}^d$ by inscribed polytopes with a restricted number of vertices under the intrinsic volume difference. We prove rigidity phenomena in both…

In this paper I will approach the computation of the maximum density of regular lattices in large dimensions using a statistical mechanics approach. The starting point will be some theorems of Roger, which are virtually unknown in the…

In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…

Recent advances in statistics introduced versions of the central limit theorem for high-dimensional vectors, allowing for the construction of confidence regions for high-dimensional parameters. In this note, $s$-sparsely convex…

We study the problem of learning a high-density region of an arbitrary distribution over $\mathbb{R}^d$. Given a target coverage parameter $\delta$, and sample access to an arbitrary distribution $D$, we want to output a confidence set $S…

Let $P_{n}$ be a set of $n$ points, including the origin, in the unit square $U = [0,1]^2$. We consider the problem of constructing $n$ axis-parallel and mutually disjoint rectangles inside $U$ such that the bottom-left corner of each…

In this paper we consider ball packings in $4$-dimensional hyperbolic space. We show that it is possible to exceed the conjectured $4$-dimensional realizable packing density upper bound due to L. Fejes T\'oth (Regular Figures, 1964). We…

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 curvature parameter tension between Planck 2018, cosmic microwave background lensing, and baryon acoustic oscillation data is measured using the suspiciousness statistic to be 2.5 to 3$\sigma$. Conclusions regarding the spatial…

We completely characterize isoperimetric regions in R^n with density e^h, where h is convex, smooth, and radially symmetric. In particular, balls around the origin constitute isoperimetric regions of any given volume, proving the Log-Convex…

Statler (1987) demonstrated that self-consistent triaxial models with the perfect density law could be constructed for virtually any choice of axis ratios. His experiments are repeated here using triaxial mass models based on Jaffe's…

We call a periodic ball packing in d-dimensional Euclidean space periodically (strictly) jammed with respect to a period lattice if there are no nontrivial motions of the balls that preserve the period (that maintain some period with…

The Small Ball Inequality is a conjectural lower bound on sums the L-infinity norm of sums of Haar functions supported on dyadic rectangles of a fixed volume in the unit cube. The conjecture is fundamental to questions in discrepancy…

There are several approaches for using computers in deriving mathematical proofs. For their illustration, we provide an in-depth study of using computer support for proving one complex combinatorial conjecture -- correctness of a strategy…

In this paper we generalize the classical theorem of Thue about the optimal circular disc packing in the plane. We are given a family of circular discs, not necessarily of equal radii, with the property that the inflation of every disc by a…

We provide conjectural necessary and (separately) sufficient conditions for the Hilbert scheme of points of a given length to have the maximum dimension tangent space at a point. The sufficient condition is claimed for 3D and reduces the…