Related papers: Sparse stable configurations of hard discs in a bo…
We create mechanically stable (MS) packings of bidisperse disks using an algorithm in which we successively grow or shrink soft repulsive disks followed by energy minimization until the overlaps are vanishingly small. We focus on small…
We study dense packings of a large number of congruent non-overlapping circles inside a square by looking for configurations which maximize the packing density, defined as the ratio between the area occupied by the disks and the area of the…
We propose locally stable sparse hard-disk packings, as introduced by B\"or\"oczky, as a model for the analysis and benchmarking of Markov-chain Monte Carlo (MCMC) algorithms. We first generate such packings in a square box with periodic…
By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packings are in fact optimal. When applied to the previously…
In this paper we explain how to convert discrete invariants into stable ones via what we call hierarchical stabilization. We illustrate this process by constructing stable invariants for multi-parameter persistence modules with respect to…
We developed a novel experimental technique to generate mechanically stable (MS) packings of frictionless granular disks. We performed a series of coordinated experiments and numerical simulations to enumerate the MS packings in small 2D…
Consider the problem of approximating a given probability distribution on the cube $[0,1]^n$ via the use of a square lattice discretization with mesh-size $1/N$ and the Metropolis algorithm. Here the dimension $n$ is fixed and we focus for…
Packings of equal disks in the plane are known to have density at most $\pi/\sqrt{12}$, although this density is never achieved in the square torus, which is what we call the plane modulo the square lattice. We find packings of disks in a…
We examine sequences of dense packings of n congruent non-overlapping disks inside a square which follow specific patterns as n increases along certain values, n = n(1), n(2),... n(k),.... Extending and improving previous work of Nurmela…
The densest packings of N unit squares in a torus are studied using analytical methods as well as simulated annealing. A rich array of dense packing solutions are found: density-one packings when N is the sum of two square integers; a…
Given an infinitesimal perturbation of a discrete-time finite Markov chain, we seek the states that are stable despite the perturbation, \textit{i.e.} the states whose weights in the stationary distributions can be bounded away from $0$ as…
Relative frequencies of mechanically stable (MS) packings of frictionless bidisperse disks are studied numerically in small systems. The packings are created by successively compressing or decompressing a system of soft purely repulsive…
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…
We consider the existence and stability of static configurations of a scalar field in a five dimensional spacetime in which the extra spatial dimension is compactified on an $S^1/Z_2$ orbifold. For a wide class of potentials with multiple…
We devise a Monte Carlo based method for detecting whether a non-negative Markov chain is stable for a given set of parameter values. More precisely, for a given subset of the parameter space, we develop an algorithm that is capable of…
A class of graphs is structurally nowhere dense if it can be constructed from a nowhere dense class by a first-order transduction. Structurally nowhere dense classes vastly generalize nowhere dense classes and constitute important examples…
We consider the problem of designing uniformly stable first-order optimization algorithms for empirical risk minimization. Uniform stability is often used to obtain generalization error bounds for optimization algorithms, and we are…
We provide a tight result for a fundamental problem arising from packing squares into a circular container: The critical density of packing squares into a disk is $\delta=\frac{8}{5\pi}\approx 0.509$. This implies that any set of (not…
We consider static configurations of bulk scalar fields in extra dimensional models in which the fifth dimension is an $S^1/Z_2$ orbifold. There may exist a finite number of such configurations, with total number depending on the size of…