arXiv subjects

Yoav Kallus

Publications and source records attributed to Yoav Kallus.

At least 19 recordsLinked to original sources

arXiv2019

Locally optimal 2-periodic sphere packings

The sphere packing problem is an old puzzle. We consider packings with m spheres in the unit cell (m-periodic packings). For the case m = 1 (lattice packings), Voronoi proved there are finitely many inequivalent local optima and presented an algorithm to enumerate them, and this computation has been implemented in up to d = 8 dimensions. We generalize Voronoi's method to m > 1 and present a procedure to enumerate all locally optimal 2-periodic sphere packings in any dimension, provided there are finitely many. We implement this computation in d = 3, 4, and 5 and show that no 2-periodic packing surpasses the density of the optimal lattices in these dimensions. A partial enumeration is performed in d = 6.

math.MG↗

arXiv2018

Improved upper bounds in the moving sofa problem

The moving sofa problem, posed by L. Moser in 1966, asks for the planar shape of maximal area that can move around a right-angled corner in a hallway of unit width. It is known that a maximal area shape exists, and that its area is at least 2.2195... - the area of an explicit construction found by Gerver in 1992 - and at most $2\sqrt{2}=2.82...$, with the lower bound being conjectured as the true value. We prove a new and improved upper bound of 2.37. The method involves a computer-assisted proof scheme that can be used to rigorously derive further improved upper bounds that converge to the correct value.

math.MG↗

arXiv2017

A linear-time algorithm for the maximum-area inscribed triangle in a convex polygon

Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, Löffler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here we give an algorithm with linear time complexity.

cs.CG↗

arXiv2017

On the records

World record setting has long attracted public interest and scientific investigation. Extremal records summarize the limits of the space explored by a process, and the historical progression of a record sheds light on the underlying dynamics of the process. Existing analyses of prediction, statistical properties, and ultimate limits of record progressions have focused on particular domains. However, a broad perspective on how record progressions vary across different spheres of activity needs further development. Here we employ cross-cutting metrics to compare records across a variety of domains, including sports, games, biological evolution, and technological development. We find that these domains exhibit characteristic statistical signatures in terms of rates of improvement, "burstiness" of record-breaking time series, and the acceleration of the record breaking process. Specifically, sports and games exhibit the slowest rate of improvement and a wide range of rates of "burstiness." Technology improves at a much faster rate and, unlike other domains, tends to show acceleration in records. Many biological and technological processes are characterized by constant rates of improvement, showing less burstiness than sports and games. It is important to understand how these statistical properties of record progression emerge from the underlying dynamics. Towards this end, we conduct a detailed analysis of a particular record-setting event: elite marathon running. In this domain, we find that studying record-setting data alone can obscure many of the structural properties of the underlying process. The marathon study also illustrates how some of the standard statistical assumptions underlying record progression models may be inappropriate or commonly violated in real-world datasets.

physics.soc-ph↗

arXiv2017

Dynamics of beneficial epidemics

Pathogens can spread epidemically through populations. Beneficial contagions, such as viruses that enhance host survival or technological innovations that improve quality of life, also have the potential to spread epidemically. How do the dynamics of beneficial biological and social epidemics differ from those of detrimental epidemics? We investigate this question using three theoretical approaches. First, in the context of population genetics, we show that a horizontally-transmissible element that increases fitness, such as viral DNA, spreads superexponentially through a population, more quickly than a beneficial mutation. Second, in the context of behavioral epidemiology, we show that infections that cause increased connectivity lead to superexponential fixation in the population. Third, in the context of dynamic social networks, we find that preferences for increased global infection accelerate spread and produce superexponential fixation, but preferences for local assortativity halt epidemics by disconnecting the infected from the susceptible. We conclude that the dynamics of beneficial biological and social epidemics are characterized by the rapid spread of beneficial elements, which is facilitated in biological systems by horizontal transmission and in social systems by active spreading behavior of infected individuals.

physics.soc-ph↗

arXiv2016

Paradoxes in Leaky Microbial Trade

Microbes produce metabolic resources that are important for cell growth yet leak across membranes into the extracellular environment. Other microbes in the same environment can use these resources and adjust their own metabolic production accordingly---causing other resources to leak into the environment. The combined effect of these processes is an economy in which organismal growth and metabolic production are coupled to others in the community. We propose a model for the co-evolving dynamics of metabolite concentrations, production regulation, and population frequencies for the case of two cell types, each requiring and capable of producing two metabolites. In this model, beneficial trade relations emerge without any coordination, via individual-level production decisions that maximize each cell's growth rate given its perceived environment. As we vary production parameters of the model, we encounter three paradoxical behaviors, where a change that should intuitively benefit some cell type, actually harms it. (1) If a cell type is more efficient than its counterpart at producing a metabolite and becomes even more efficient, its frequency in the population can decrease. (2) If a cell type is less efficient than its counterpart at producing a metabolite but becomes less inefficient, the growth rate of the population can decrease. (3) Finally, if a cell type controls its counterpart's production decisions so as to maximize its own growth rate, the ultimate growth rate it achieves can be lower than if the two cell types each maximized their own growth. These three paradoxes highlight the complex and counter-intuitive dynamics that emerge in simple microbial economies.

q-bio.PE↗

arXiv2016

Free energy of singular sticky-sphere clusters

Networks of particles connected by springs model many condensed-matter systems, from colloids interacting with a short-range potential, to complex fluids near jamming, to self-assembled lattices, to origami-inspired materials. Under small thermal fluctuations the vibrational entropy of a ground state is given by the harmonic approximation if it has no zero-frequency vibrational modes, yet such singular modes are at the epicenter of many interesting behaviors in the systems above. We consider a system of $N$ spherical particles, and directly account for the singularities that arise in the sticky limit where the pairwise interaction is strong and short ranged. Although the contribution to the partition function from singular clusters diverges in the limit, its asymptotic value can be calculated and depends on only two parameters, characterizing the depth and range of the potential. The result holds for systems that are second-order rigid, a geometric characterization that describes all known ground-state (rigid) sticky clusters. To illustrate our theory we address the question of emergence: how does crystalline order arise in large systems when it is strongly disfavored in small ones? We calculate the partition functions of all known rigid clusters up to $N\leq 19$, and show the cluster landscape is dominated by hyperstatic clusters (those with more than $3N-6$ contacts) -- singular and isostatic clusters are far less frequent, despite their extra vibrational and configurational entropies. Since the most hyperstatic clusters are close to fragments of a close-packed lattice, this underlies the emergence of order in sticky-sphere systems, even those as small as $N=10$.

cond-mat.stat-mech↗

arXiv2016

The random packing density of nearly spherical particles

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. By leveraging existing understanding of the random packing of spherical particles, we estimate the random packing density for all sufficiently spherical shapes. Our method uses the ensemble of random packing configurations of spheres as a reference point for a perturbative calculation, which we carry to linear order in the deformation. A fully analytic calculation shows that all sufficiently spherical shapes pack more densely than spheres. Additionally, we use simulation data for spheres to calculate numerical estimates for nonspherical particles and compare these estimates to simulations.

cond-mat.soft↗

arXiv2015

Scaling collapse at the jamming transition

The jamming transition of particles with finite-range interactions is characterized by a variety of critical phenomena, including power law distributions of marginal contacts. We numerically study a recently proposed simple model of jamming, which is conjectured to lie in the same universality class as the jamming of spheres in all dimensions. We extract numerical estimates of the critical exponents, θ = 0.451 $\pm$ 0.006 and γ = 0.404 $\pm$ 0.004, that match the exponents observed in sphere packing systems. We analyze finite-size scaling effects that manifest in a subcritical cutoff regime and size-independent, but protocol-dependent scaling curves. Our results supports the conjectured link with sphere jamming, provide more precise measurements of the critical exponents than previously reported, and shed light on the finite-size scaling behavior of continuous constraint satisfiability transitions.

cond-mat.stat-mech↗

arXiv2015

The local optimality of the double lattice packing

This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and Kuperberg is also locally optimal in the full space of packings.

math.MG↗

arXiv2014

Pessimal packing shapes

We address the question of which convex shapes, when packed as densely as possible under certain restrictions, fill the least space and leave the most empty space. In each different dimension and under each different set of restrictions, this question is expected to have a different answer or perhaps no answer at all. As the problem of identifying global minima in most cases appears to be beyond current reach, in this paper we focus on local minima. We review some known results and prove these new results: in two dimensions, the regular heptagon is a local minimum of the double-lattice packing density, and in three dimensions, the directional derivative (in the sense of Minkowski addition) of the double-lattice packing density at the point in the space of shapes corresponding to the ball is in every direction positive.

math.MG↗

arXiv2014

When is the ball a local pessimum for covering?

We consider the problem of identifying the worst point-symmetric shape for covering n-dimensional Euclidean space with lattice translates. Here we focus on the dimensions where the thinnest lattice covering with balls is known and ask whether the ball is a pessimum for covering in these dimensions compared to all point-symmetric convex shapes. We find that the ball is a local pessimum in 3 dimensions, but not so for 4 and 5 dimensions.

math.MG↗

arXiv2014

Marginal stability in jammed packings: quasicontacts and weak contacts

Maximally random jammed (MRJ) sphere packing is a prototypical example of a system naturally poised at the margin between underconstraint and overconstraint. This marginal stability has traditionally been understood in terms of isostaticity, the equality of the number of mechanical contacts and the number of degrees of freedom. Quasicontacts, pairs of spheres on the verge of coming in contact, are irrelevant for static stability, but they come into play when considering dynamic stability, as does the distribution of contact forces. We show that the effects of marginal dynamic stability, as manifested in the distributions of quasicontacts and weak contacts, are consequential and nontrivial. We study these ideas first in the context of MRJ packing of d-dimensional spheres, where we show that the abundance of quasicontacts grows at a faster rate than that of contacts. We reexamine a calculation of Jin et al. (Phys. Rev. E 82, 051126, 2010), where quasicontacts were originally neglected, and we explore the effect of their inclusion in the calculation. This analysis yields an estimate of the asymptotic behavior of the packing density in high dimensions. We argue that this estimate should be reinterpreted as a lower bound. The latter part of the paper is devoted to Bravais lattice packings that possess the minimum number of contacts to maintain mechanical stability. We show that quasicontacts play an even more important role in these packings. We also show that jammed lattices are a useful setting for studying the Edwards ensemble, which weights each mechanically stable configuration equally and does not account for dynamics. This ansatz fails to predict the power-law distribution of near-zero contact forces, $P(f)\sim f^θ$.

cond-mat.stat-mech↗

arXiv2014

The 3-ball is a local pessimum for packing

It was conjectured by Ulam that the ball has the lowest optimal packing fraction out of all convex, three-dimensional solids. Here we prove that any origin-symmetric convex solid of sufficiently small asphericity can be packed at a higher efficiency than balls. We also show that in dimensions 4, 5, 6, 7, 8, and 24 there are origin-symmetric convex bodies of arbitrarily small asphericity that cannot be packed using a lattice as efficiently as balls can be.

math.MG↗

arXiv2014

Jammed lattice sphere packings

We generate and study an ensemble of isostatic jammed hard-sphere lattices. These lattices are obtained by compression of a periodic system with an adaptive unit cell containing a single sphere until the point of mechanical stability. We present detailed numerical data about the densities, pair correlations, force distributions, and structure factors of such lattices. We show that this model retains many of the crucial structural features of the classical hard-sphere model and propose it as a model for the jamming and glass transitions that enables exploration of much higher dimensions than are usually accessible.

cond-mat.stat-mech↗

arXiv2013

Inextensible domains

We develop a theory of planar, origin-symmetric, convex domains that are inextensible with respect to lattice covering, that is, domains such that augmenting them in any way allows fewer domains to cover the same area. We show that origin-symmetric inextensible domains are exactly the origin-symmetric convex domains with a circle of outer billiard triangles. We address a conjecture by Genin and Tabachnikov about convex domains, not necessarily symmetric, with a circle of outer billiard triangles, and show that it follows immediately from a result of Sas.

math.MG↗

arXiv2013

Statistical mechanics of the lattice sphere packing problem

We present an efficient Monte Carlo method for the lattice sphere packing problem in d dimensions. We use this method to numerically discover de novo the densest lattice sphere packing in dimensions 9 through 20. Our method goes beyond previous methods not only in exploring higher dimensions but also in shedding light on the statistical mechanics underlying the problem in question. We observe evidence of a phase transition in the thermodynamic limit $d\to\infty$. In the dimensions explored in the present work, the results are consistent with a first-order crystallization transition, but leave open the possibility that a glass transition is manifested in higher dimensions.

cond-mat.stat-mech↗

arXiv2010

Dense packing crystal structures of physical tetrahedra

We present a method for discovering dense packings of general convex hard particles and apply it to study the dense packing behavior of a one-parameter family of particles with tetrahedral symmetry representing a deformation of the ideal mathematical tetrahedron into a less ideal, physical, tetrahedron and all the way to the sphere. Thus, we also connect the two well studied problems of sphere packing and tetrahedron packing on a single axis. Our numerical results uncover a rich optimal-packing behavior, compared to that of other continuous families of particles previously studied. We present four structures as candidates for the optimal packing at different values of the parameter, providing an atlas of crystal structures which might be observed in systems of nano-particles with tetrahedral symmetry.

cond-mat.soft↗