English
Related papers

Related papers: A computer verification of the Kepler conjecture

200 papers

In this paper, an intuitive mathematical formulation is provided to generalize the residual entanglement for tripartite systems of qubits (Phys. Rev. A \textbf{61}, 052306 (2000)) to the tripartite systems in higher dimension. The spirit…

Quantum Physics · Physics 2007-05-23 Chang-shui Yu He-shan Song

Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest…

Metric Geometry · Mathematics 2007-05-23 Ulrich Betke , Martin Henk

A shape optimization program is developed for the ratio of Riesz capacities $\text{Cap}_q(K)/\text{Cap}_p(K)$, where $K$ ranges over compact sets in $\mathbb{R}^n$. In different regions of the $pq$-parameter plane, maximality is conjectured…

Classical Analysis and ODEs · Mathematics 2024-10-22 Carrie Clark , Richard S. Laugesen

Consider a bin containing $n$ balls colored with two colors. In a $k$-query, $k$ balls are selected by a questioner and the oracle's reply is related (depending on the computation model being considered) to the distribution of colors of the…

Data Structures and Algorithms · Computer Science 2011-05-10 Gianluca De Marco , Evangelos Kranakis , Gabor Wiener

We derive concentration inequalities for the supremum norm of the difference between a kernel density estimator (KDE) and its point-wise expectation that hold uniformly over the selection of the bandwidth and under weaker conditions on the…

Statistics Theory · Mathematics 2020-01-01 Jisu Kim , Jaehyeok Shin , Alessandro Rinaldo , Larry Wasserman

A conjecture arising naturally in the investigation of additivity of classical information capacity of quantum channels states that the maximal purity of outputs from a quantum channel, as measured by the p-norm, should be multiplicative…

Quantum Physics · Physics 2015-06-26 R. F. Werner , A. S. Holevo

Recently, Gilmer proved the first constant lower bound for the union-closed sets conjecture via an information-theoretic argument. The heart of the argument is an entropic inequality involving the OR function of two i.i.d.\ binary vectors,…

Information Theory · Computer Science 2023-06-16 Jingbo Liu

We re-confirm, for the case of the unit p-ball of R^n, one of recent conjectures of G.Kuperberg on centrally symmetric convex bodies.This conjecture was very recently confirmrd for this particular case by D.A.Gutierrez using polygamma…

Classical Analysis and ODEs · Mathematics 2008-02-15 D. Karayannakis

Let psi: R^n --> R^k be a map defined by k positive definite quadratic forms on R^n. We prove that the relative entropy (Kullback-Leibler) distance from the convex hull of the image of psi to the image of psi is bounded above by an absolute…

Metric Geometry · Mathematics 2013-05-02 Alexander Barvinok

Predicting theoretically the highest density, which a disordered packing of discs can achieve, has been a long-standing unresolved problem. Such predictions are hindered by two difficulties - the dependence of the density on the packing…

Soft Condensed Matter · Physics 2026-05-26 Raphael Blumenfeld

Dense packings have served as useful models of the structure of liquid, glassy and crystal states of matter, granular media, heterogeneous materials, and biological systems. Probing the symmetries and other mathematical properties of the…

Statistical Mechanics · Physics 2015-05-14 S. Torquato , Y. Jiao

We consider packings of the plane using discs of radius 1 and r=0.545151... . The value of r admits compact packings in which each hole in the packing is formed by three discs which are tangent to each other. We prove that the largest…

Metric Geometry · Mathematics 2007-05-23 Tom Kennedy

We present numerical simulations that allow us to compute the number of ways in which $N$ particles can pack into a given volume $V$. Our technique modifies the method of Xu et al. (Phys. Rev. Lett. 106, 245502 (2011)) and outperforms…

Soft Condensed Matter · Physics 2015-06-18 Daniel Asenjo , Fabien Paillusson , Daan Frenkel

Dense polyhedron packings are useful models of a variety of condensed matter and biological systems and have intrigued scientists mathematicians for centuries. Recently, organizing principles for the types of structures associated with the…

Soft Condensed Matter · Physics 2011-09-28 Yang Jiao , Sal Torquato

In a previous study (quant-ph/9911058), several remarkably simple exact results were found, in certain specialized m-dimensional scenarios (m<5), for the a priori probability that a pair of qubits is unentangled/separable. The measure used…

Quantum Physics · Physics 2007-05-23 Paul B. Slater

It has been known for almost 200 years that some angles cannot be trisected by straightedge and compass alone. This paper studies the set of such angles as well as its complement $\mathcal{T}$, both regarded as subsets of the unit circle…

Number Theory · Mathematics 2011-08-16 Peter J. Kahn

A bounded Apollonian circle packing (ACP) is an ancient Greek construction which is made by repeatedly inscribing circles into the triangular interstices in a Descartes configuration of four mutually tangent circles. Remarkably, if the…

Number Theory · Mathematics 2010-01-25 Jean Bourgain , Elena Fuchs

Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…

Soft Condensed Matter · Physics 2009-12-17 Kenneth W. Desmond , Eric R. Weeks

In decision-making problems under uncertainty, probabilistic constraints are a valuable tool to express safety of decisions. They result from taking the probability measure of a given set of random inequalities depending on the decision…

Optimization and Control · Mathematics 2021-02-09 Yassine Laguel , Wim van Ackooij , Jérôme Malick , Guilherme Ramalho

The set of integers which can be written as the sum of four prime cubes has lower density at least $0.009664$. This improves earlier bounds of $0.003125$ by Ren and $0.005776$ by Liu.

Number Theory · Mathematics 2019-02-27 Christian Elsholtz , Jan-Christoph Schlage-Puchta