English
Related papers

Related papers: Random perfect lattices and the sphere packing pro…

200 papers

1) We present new lattice sphere packings in Euclid spaces of many dimensions in the range 3332-4096, which are denser than known densest Mrodell-Weil lattice sphere packings in these dimensions. Moreover it is proved that if there were…

Number Theory · Mathematics 2012-06-01 Hao Chen

The behavior of a Lattice Monte Carlo algorithm (if it is designed correctly) must approach that of the continuum system that it is designed to simulate as the time step and the mesh step tend to zero. However, we show for an algorithm for…

Statistical Mechanics · Physics 2010-08-23 Mykyta V. Chubynsky , Gary W. Slater

We study random walks in random environments generated by the two-dimensional Gaussian free field. More specifically, we consider a rescaled lattice with a small mesh size and view it as a random network where each edge is equipped with an…

Probability · Mathematics 2024-09-30 Jian Ding , Jiamin Wang

We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean limit. We axiomatize key properties of sphere packing bounds…

Metric Geometry · Mathematics 2021-08-26 Henry Cohn , Andrew Salmon

We analyze a new random algorithm for numerical integration of $d$-variate functions over $[0,1]^d$ from a weighted Sobolev space with dominating mixed smoothness $\alpha\ge 0$ and product weights $1\ge\gamma_1\ge\gamma_2\ge\cdots>0$, where…

Numerical Analysis · Mathematics 2019-08-15 Peter Kritzer , Frances Y. Kuo , Dirk Nuyens , Mario Ullrich

Obtaining general relations between macroscopic properties of random assemblies, such as density, and the microscopic properties of their constituent particles, such as shape, is a foundational challenge in the study of amorphous materials.…

Soft Condensed Matter · Physics 2016-05-05 Yoav Kallus

The local structure of disordered jammed packings of monodisperse spheres without friction, generated by the Lubachevsky-Stillinger algorithm, is studied for packing fractions above and below 64%. The structural similarity of the particle…

Soft Condensed Matter · Physics 2015-06-04 Sebastian C. Kapfer , Walter Mickel , Klaus Mecke , Gerd E. Schröder-Turk

We propose a unified framework that synthesizes advances in high-dimensional lattice theory with novel computational algorithms for the shortest vector problem (SVP) to model pure root lattices and compute sphere packing densities. Building…

General Physics · Physics 2025-03-20 C D MacDonald , S R MacDonald

A new approach to exploring low-temperature excitations in finite-dimensional lattice spin glasses is proposed. By focusing on bond-diluted lattices just above the percolation threshold, large system sizes $L$ can be obtained which lead to…

Disordered Systems and Neural Networks · Physics 2009-11-10 S. Boettcher

Maximum-density dimer packings (maximum matchings) of non-bipartite site-diluted lattices, such as the triangular and Shastry-Sutherland lattices in $d=2$ dimensions and the stacked-triangular and corner-sharing octahedral lattices in…

Disordered Systems and Neural Networks · Physics 2025-05-21 Ritesh Bhola , Kedar Damle

Building on Viazovska's recent solution of the sphere packing problem in eight dimensions, we prove that the Leech lattice is the densest packing of congruent spheres in twenty-four dimensions and that it is the unique optimal periodic…

Number Theory · Mathematics 2017-08-29 Henry Cohn , Abhinav Kumar , Stephen D. Miller , Danylo Radchenko , Maryna Viazovska

Lattices with minimal normalized second moments are designed using a new numerical optimization algorithm. Starting from a random lower-triangular generator matrix and applying stochastic gradient descent, all elements are updated towards…

Information Theory · Computer Science 2025-07-24 Erik Agrell , Daniel Pook-Kolb , Bruce Allen

The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…

Soft Condensed Matter · Physics 2010-01-05 Robert S. Farr , Robert D. Groot

We study ideal lattices in $\mathbb{R}^2$ coming from real quadratic fields, and give an explicit method for computing all well-rounded twists of any such ideal lattice. We apply this to ideal lattices coming from Markoff numbers to…

Number Theory · Mathematics 2018-09-21 Mohamed Taoufiq Damir , David Karpuk

Let $\omega=(-1+\sqrt{-3})/2$. For any lattice $P\subseteq \mathbb{Z}^n$, $\mathcal{P}=P+\omega P$ is a subgroup of $\mathcal{O}_K^n$, where $\mathcal{O}_K=\mathbb{Z}[\omega]\subseteq \mathbb{C}$. As $\mathbb{C}$ is naturally isomorphic to…

Number Theory · Mathematics 2015-08-13 Shantian Cheng

We study a lattice model of attractive colloids. It is exactly solvable on sparse random graphs. As the pressure and temperature are varied it reproduces many characteristic phenomena of liquids, glasses and colloidal systems such as ideal…

Soft Condensed Matter · Physics 2008-10-15 Florent Krzakala , Marco Tarzia , Lenka Zdeborová

A novel family of dynamical Monte Carlo algorithms for lattice polymers is proposed. Our central idea is to simulate an extended ensemble in which the self-avoiding condition is systematically weakened. The degree of the self-overlap is…

Condensed Matter · Physics 2009-10-31 Yukito Iba , George Chikenji , Macoto Kikuchi

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

This study investigates Hermitian rank-metric codes, a special class of rank-metric codes, focusing on perfect codes and on the analysis of their covering properties. Firstly, we establish bounds on the size of spheres in the space of…

Information Theory · Computer Science 2025-08-07 Usman Mushrraf

New series of $2^{2m}$-dimensional universally strongly perfect lattices $\Lambda_I $ and $\Gamma_J $ are constructed with $$2BW_{2m} ^{\#} \subseteq \Gamma _J \subseteq BW_{2m} \subseteq \Lambda _I \subseteq BW _{2m}^{\#} .$$ The lattices…

Number Theory · Mathematics 2021-11-15 Sihuang Hu , Gabriele Nebe