Related papers: Sparse stable configurations of hard discs in a bo…
Packing problems, which ask how to arrange a collection of objects in space to meet certain criteria, are important in a great many physical and biological systems, where geometrical arrangements at small scales control behaviour at larger…
The calculation of the transfer matrix for a large non-periodic multilayered system may become unstable in the presence of absorption. We discuss the origin of this instability and we explore two methods to overcome it: the use of a total…
In nonequilibrium statistical physics, quantifying the nearest (and higher-order) neighbors and free volumes of particles in many-body systems is crucial to elucidating the origin of macroscopic collective phenomena, such as glass/granular…
We consider hard-disc mixtures with disc sizes within ratio $\sqrt{2}-1$, that is, the small disc exactly fits in the hole between four large discs. For each prescribed stoichiometry of large and small discs, the densest packings are…
In this paper, we consider a matroid generalization of the stable matching problem. In particular, we consider the setting where preferences may contain ties. For this generalization, we propose a polynomial-time algorithm for the problem…
We use numerical simulation to investigate and analyze the way that rigid disks and spheres arrange themselves when compressed next to incommensurate substrates. For disks, a movable set is pressed into a jammed state against an ordered…
We present three new approximation algorithms with improved constant ratios for selecting $n$ points in $n$ disks such that the minimum pairwise distance among the points is maximized. (1) A very simple $O(n\log n)$-time algorithm with…
The method originally developed by Kalnajs for the numerical linear stability analysis of round galactic disks is implemented in the regimes of non-analytic transformations between position space and angle-action space, and of vanishing…
In prior work, Gupta et al. (SPAA 2022) presented a distributed algorithm for multiplying sparse $n \times n$ matrices, using $n$ computers. They assumed that the input matrices are uniformly sparse--there are at most $d$ non-zeros in each…
Static packings of perfectly rigid particles are investigated theoretically and numerically. The problem of finding the contact forces in such packings is formulated mathematically. Letting the values of the contact forces define a vector…
The stable and unstable solutions of a square 2D extreme type-II superconductor are studied in the field of a magnetic disc. We use a preconditioned Newton-Krylov solver to find the solutions and use numerical continuation to track the…
We investigate random complex dynamics of rational or polynomial maps on the Riemann sphere. We show that regarding random complex dynamics of polynomials, generically, the chaos of the averaged system disappears at any point in the Riemann…
We study packings of $n$ hard spheres of equal radius in the $d$-dimensional unit cube. We present a nonsmooth function whose local extrema are the radii of jammed packings (where no subset of spheres can be moved keeping all others fixed)…
In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^{\omega +…
In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…
In this paper, we propose a distributed computing approach to solving large-scale robust stability problems on the simplex. Our approach is to formulate the robust stability problem as an optimization problem with polynomial variables and…
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
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 investigate…
Stability selection (Meinshausen and Buhlmann, 2010) makes any feature selection method more stable by returning only those features that are consistently selected across many subsamples. We prove (in what is, to our knowledge, the first…