中文
相关论文

相关论文: A nonsmooth program for jamming hard spheres

200 篇论文

We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super…

度量几何 · 数学 2016-07-21 Oleg R. Musin , Anton V. Nikitenko

A subcomplex $X\leq \mathcal{C}$ of a simplicial complex is strongly rigid if every locally injective, simplicial map $X\to\mathcal{C}$ is the restriction of a unique automorphism of $\mathcal{C}$. Aramayona and the second author proved…

几何拓扑 · 数学 2022-07-08 Edgar A. Bering , Christopher J. Leininger

Hard spheres are ubiquitous in condensed matter: they have been used as models for liquids, crystals, colloidal systems, granular systems, and powders. Packings of hard spheres are of even wider interest, as they are related to important…

无序系统与神经网络 · 物理学 2015-03-13 Giorgio Parisi , Francesco Zamponi

Elementary smooth functions (beyond contact) are employed to construct pair correlation functions that mimic jammed disordered sphere packings. Using the g2-invariant optimization method of Torquato and Stillinger [J. Phys. Chem. B 106,…

统计力学 · 物理学 2009-11-13 Adam B. Hopkins , Frank H. Stillinger , Salvatore Torquato

We derive fundamental asymptotic results for the expected covering radius $\rho(X_N)$ for $N$ points that are randomly and independently distributed with respect to surface measure on a sphere as well as on a class of smooth manifolds. For…

概率论 · 数学 2015-04-14 A. Reznikov , E. B. Saff

We generate non-lattice packings of spheres in up to 22 dimensions using the geometrical constraint satisfaction algorithm RRR. Our aggregated data suggest that it is easy to double the density of Ball's lower bound, and more tentatively,…

度量几何 · 数学 2023-07-12 Veit Elser

We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…

计算几何 · 计算机科学 2024-12-24 Pritam Acharya , Sujoy Bhore , Aaryan Gupta , Arindam Khan , Bratin Mondal , Andreas Wiese

In this paper using the concept of the extended Hamming code we give a construction for dense packing of points at distance at least one in such unit cubes which dimension are a power of two.

度量几何 · 数学 2009-10-07 Á. G. Horváth

Packing problems have been a source of fascination for millenia and their study has produced a rich literature that spans numerous disciplines. Investigations of hard-particle packing models have provided basic insights into the structure…

统计力学 · 物理学 2018-08-01 Salvatore Torquato

Hyperuniformity characterizes a state of matter for which density fluctuations diminish towards zero at the largest length scales. However, the task of determining whether or not an experimental system is hyperuniform is experimentally…

软凝聚态物质 · 物理学 2015-06-22 Remi Dreyfus , Ye Xu , Tim Still , Lawrence A. Hough , A. G. Yodh , Salvatore Torquato

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…

度量几何 · 数学 2025-05-07 Károly Bezdek , Zsolt Lángi

We numerically simulate mechanically stable packings of soft-core, frictionless, bidisperse disks in two dimensions, above the jamming packing fraction $\phi_J$. For configurations with a fixed isotropic global stress tensor, we compute the…

软凝聚态物质 · 物理学 2015-03-18 Yegang Wu , S. Teitel

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

组合数学 · 数学 2025-07-16 Boris Bukh , Aleksandre Saatashvili

The problem of packing equal spheres in a spherical container is a classic global optimization problem, which has attracted enormous studies in academia and found various applications in industry. This problem is computationally…

计算几何 · 计算机科学 2023-05-18 Jianrong Zhou , Shuo Ren , Kun He , Yanli Liu , Chu-Min Li

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…

软凝聚态物质 · 物理学 2015-06-04 Sebastian C. Kapfer , Walter Mickel , Klaus Mecke , Gerd E. Schröder-Turk

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…

软凝聚态物质 · 物理学 2009-12-17 Kenneth W. Desmond , Eric R. Weeks

We present the algorithm for generating strictly saturated random sequential adsorption packings built of rounded polygons. It can be used to study various properties of such packings built of a wide variety of different shapes and in…

统计力学 · 物理学 2021-06-23 Michał Cieśla , Piotr Kubala , Konrad Kozubek

Several conditions are given when a packing of equal disks in a torus is locally maximally dense, where the torus is defined as the quotient of the plane by a two-dimensional lattice. Conjectures are presented that claim that the density of…

度量几何 · 数学 2013-01-08 Robert Connelly , William Dickinson

In this article, using the computer, are enumerated all locally-rigid packings by $N$ congruent circles (spherical caps) on the unit sphere ${\Bbb S}^2 $ with $N < 12.$ This is equivalent to the enumeration of irreducible spherical contact…

度量几何 · 数学 2013-12-20 Oleg Musin , Alexey Tarasov

The aim of this paper is to review and discuss qualitatively some results on the properties of amorphous packings of hard spheres that were recently obtained by means of the replica method. The theory gives predictions for the equation of…

无序系统与神经网络 · 物理学 2009-11-11 F. Zamponi