English
Related papers

Related papers: Rigidity for sticky disks

200 papers

An extremal $k$-packing is a collection of $k$ mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus $g\ge 3$ containing extremal…

Metric Geometry · Mathematics 2019-07-04 Ernesto Girondo , Cristian Reyes

We study the balance in dynamical support of 384 galaxies with stellar kinematics out to >1.5R_e in the Sydney AAO Multi-object Integral Field (SAMI) Galaxy Survey. We present radial dynamical profiles of the local rotation dominance…

Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…

Computational Geometry · Computer Science 2015-05-14 Herbert Edelsbrunner , Mabel Iglesias-Ham , Vitaliy Kurlin

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…

Geometric Topology · Mathematics 2018-06-11 Jason DeBlois

Maximally random jammed (MRJ) particle packings can be viewed as prototypical glasses in that they are maximally disordered while simultaneously being mechanically rigid. The prediction of the MRJ packing density phi, among other packing…

Soft Condensed Matter · Physics 2016-05-24 Jianxiang Tian , Y. Xu , Y. Jiao , S. Torquato

Rigidity, arising in discrete geometry, is the property of a structure that does not flex. Laman provides a combinatorial characterization of rigid graphs in the Euclidean plane, and thus rigid graphs in the Euclidean plane have…

Combinatorics · Mathematics 2018-06-14 Xiaofeng Gu

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…

Statistical Mechanics · Physics 2015-05-19 Salvatore Torquato , Frank H. Stillinger

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…

Metric Geometry · Mathematics 2020-08-05 Lee-Ad Gottlieb , Aryeh Kontorovich

The contact graph of an arbitrary finite packing of unit balls in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing…

Metric Geometry · Mathematics 2014-02-05 Karoly Bezdek , Samuel Reid

In this note we study the uniqueness problem for collections of pennies and marbles. More generally, consider a collection of unit $d$-spheres that may touch but not overlap. Given the existence of such a collection, one may analyse the…

Combinatorics · Mathematics 2025-09-30 Sean Dewar , Georg Grasegger , Kaie Kubjas , Fatemeh Mohammadi , Anthony Nixon

We generalize Cauchy's celebrated theorem on the global rigidity of convex polyhedra in Euclidean $3$-space $\mathbb{E}^{3}$ to the context of circle polyhedra in the $2$-sphere $\mathbb{S}^{2}$. We prove that any two convex and proper…

Metric Geometry · Mathematics 2017-06-05 John C. Bowers , Philip L. Bowers , Kevin Pratt

For each k >= 1 and corresponding hexagonal number h(k) = 3k(k+1)+1, we introduce m(k) = max[(k-1)!/ 2, 1] packings of h(k) equal disks inside a circle which we call "the curved hexagonal packings". The curved hexagonal packing of 7 disks…

Metric Geometry · Mathematics 2007-05-23 B. D. Lubachevsky , R. L. Graham

We consider the two-dimensional motion of the coupled system of a viscous incompressible fluid and a rigid disc moving with the fluid, in the whole plane. The fluid motion is described by the Navier-Stokes equations and the motion of the…

Analysis of PDEs · Mathematics 2015-05-27 Masoumeh Dashti , James C. Robinson

Amorphous packings of frictionless, spherical particles are isostatic at jamming onset, with the number of constraints (contacts) equal to the number of degrees of freedom. Their structural and mechanical properties are controlled by the…

Soft Condensed Matter · Physics 2013-05-14 Stefanos Papanikolaou , Corey S. O'Hern , Mark D. Shattuck

In a previous work (Pichardo et al. 2005), we studied stable configurations for circumstellar discs in eccentric binary systems. We searched for "invariant loops": closed curves (analogous to stable periodic orbits in time-independent…

Astrophysics · Physics 2009-11-13 Barbara Pichardo , Linda S. Sparke , Luis A. Aguilar

In this paper we introduce the notion of rigidity for harmonic-Ricci solitons and we provide some characterizations of rigidity, generalizing some known results for Ricci solitons. In the compact case we are able to deal with not…

Differential Geometry · Mathematics 2020-06-16 Andrea Anselli

Soft, amorphous solids such as tissues, foams, and emulsions are composed of deformable particles. However, the effect of single-particle deformability on the collective behavior of soft solids is still poorly understood. We perform…

Soft Condensed Matter · Physics 2021-06-02 John D. Treado , Dong Wang , Arman Boromand , Michael P. Murrell , Mark D. Shattuck , Corey S. O'Hern

We investigate the existence of random close and random loose packing limits in two-dimensional packings of monodisperse hard disks. A statistical mechanics approach-- based on several approximations to predict the probability distribution…

Soft Condensed Matter · Physics 2010-11-18 Sam Meyer , Chaoming Song , Yuliang Jin , Kun Wang , Hernán A. Makse

We study Riemannian manifolds $(M^n,g)$ with mean-convex boundary whose Ricci curvature is nonnegative in a spectral sense. Our first main result is a sharp spectral extension of a rigidity theorem by Kasue: we prove that under the…

Differential Geometry · Mathematics 2026-05-13 Gioacchino Antonelli , Yangyang Li , Paul Sweeney

A disk graph is an intersection graph of disks in $\mathbb{R}^2$. Determining the computational complexity of finding a maximum clique in a disk graph is a long-standing open problem. In 1990, Clark, Colbourn, and Johnson gave a…

Computational Geometry · Computer Science 2024-07-17 J. Mark Keil , Debajyoti Mondal