Related papers: A Solidification Phenomenon in Random Packings
We consider a planar dynamical system generated by two stable linear vector fields with distinct fixed points and random switching between them. We characterize singularities of the invariant density in terms of the switching rates and…
Packing problems, even of objects with regular geometries, are in general non-trivial. For few special shapes, the features of crystalline as well as random, irregular two-dimensional (2D) packings are known. The packing of 2D crosses does…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
We consider translationally invariant tight-binding all-bands-flat networks which lack dispersion. In a recent work [arXiv:2004.11871] we derived the subset of these networks which preserves nonlinear caging, i.e. keeps compact excitations…
We numerically study the structure of the interactions occurring in three-dimensional systems of hard spheres at jamming, focusing on the large-scale behavior. Given the fundamental role they play in the configuration of jammed packings, we…
The main aim of the paper is to provide analogues of Simpson's correspondence on singular projective varieties defined over an algebraically closed field of characteristic $p>0$. There are two main cases. In the first case, we consider…
A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density…
Random tilings or packings in the plane are characterized by a size distribution of individual elements (domains) and by the statistics of neighbor relations between the domains. Most systems occurring in nature or technology have a…
Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…
We analyze complexity in spatial network ensembles through the lens of graph entropy. Mathematically, we model a spatial network as a soft random geometric graph, i.e., a graph with two sources of randomness, namely nodes located randomly…
We investigate a relationship network of humans located in a metric space where relationships are drawn according to a distance-dependent probability density. The obtained spatial graph allows us to calculate the average separation of…
Let the class A of graphs be bridge-addable; that is, whenever a graph G in A has vertices u and v in different components then the graph G+uv is in A. For a random graph sampled uniformly from the graphs in A on vertex set {1,..,n}, there…
We study crossing numbers of dense graph drawings whose vertices are uniformly distributed either on the unit sphere or in a compact convex planar domain. We prove a sharp inequality for weighted geodesic drawings on $\mathbb S^2$ in a…
We study spatial networks constructed by randomly placing nodes on a manifold and joining two nodes with an edge whenever their distance is less than a certain cutoff. We derive the general expression for the connectivity distribution of…
Jammed packings' mechanical properties depend sensitively on their detailed local structure. Here we provide a complete characterization of the pair correlation close to contact and of the force distribution of jammed frictionless spheres.…
The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality. In the first part of the paper we concentrate…
Packing problems have been of great interest in many diverse contexts for many centuries. The optimal packing of identical objects has been often invoked to understand the nature of low temperature phases of matter. In celebrated work,…
Under sufficient permanent random covalent bonding, a fluid of atoms or small molecules is transformed into an amorphous solid network. Being amorphous, local structural properties in such networks vary across the sample. A natural order…
The paper introduces a Signed Generalized Random Dot Product Graph (SGRDPG) model, which is a variant of the Generalized Random Dot Product Graph (GRDPG), where, in addition, edges can be positive or negative. The setting is extended to a…
In this article we prove the topological minimality of unions of several almost orthogonal planes of arbitrary dimensions. A particular case was proved in arXiv:1103.1468, where we proved the Almgren minimality (which is a weaker property…