Related papers: A Linear Programming Algorithm to Test for Jamming…
Random sequential adsorption algorithm is a popular tool for modelling structure of monolayers built in irreversible adsorption experiments. However, this algorithm becomes very inefficient when the density of molecules in a layer rises.…
We present a first exact study on higher-dimensional packing problems with order constraints. Problems of this type occur naturally in applications such as logistics or computer architecture and can be interpreted as higher-dimensional…
The role of fixed degrees of freedom in soft/granular matter systems has broad applicability and theoretical interest. Here we address questions of the geometrical role that a scaffolding of fixed particles plays in tuning the threshold…
The jamming transition of soft particles characterized by narrow size distributions has been well studied by physicists. However, polydispersed systems are more relevant to engineering, and the influence of polydispersity on jamming…
We extend our theory of amorphous packings of hard spheres to binary mixtures and more generally to multicomponent systems. The theory is based on the assumption that amorphous packings produced by typical experimental or numerical…
The problem of packing unequal circles into a circular container stands as a classic and challenging optimization problem in computational geometry. This study introduces a suite of innovative and efficient methods to tackle this problem.…
We study the approach to jamming in hard-sphere packings, and, in particular, the pair correlation function $g_{2}(r)$ around contact, both theoretically and computationally. Our computational data unambiguously separates the narrowing…
We introduce the strongly NP-complete pagination problem, an extension of BIN PACKING where packing together two items may make them occupy less volume than the sum of their individual sizes. To achieve this property, an item is defined as…
We investigate the stability problem for discrete-time stochastic switched linear systems under the specific scenarios where information about the switching patterns and the probability of switches are not available. Our analysis focuses on…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…
The three dimensional structure of large packings of monosized spheres with volume fractions ranging between 0.58 and 0.64 has been studied with X-ray Computed Tomography. We search for signatures of organization, we classify local…
We present the experimental studies of highly strained soft bidisperse granular systems made of hyperelastic and plastic particles. We explore the behavior of granular matter deep in the jammed state from local field measurement from the…
In complex networks, especially social networks, networks could be divided into disjoint partitions that the ratio between the number of internal edges (the edges between the vertices within same partition) to the number of outer edges…
Due to the lack of long-range order, it remains challenging to characterize the structure of disordered solids and understand the nature of the glass transition. Here we propose a new structural order parameter by taking into account…
This is the second paper devoted to energetic rigidity, in which we apply our formalism to examples in two dimensions: underconstrained random regular spring networks, vertex models, and jammed packings of soft particles. Spring networks…
The task of atom rearrangement has emerged in the last decade as a fundamental building block for the development of neutral atom-based quantum processors. However, despite many recent efforts to develop algorithms with favorable asymptotic…
We show that an analogy between crowding in fluid and jammed phases of hard spheres captures the density dependence of the kissing number for a family of numerically generated jammed states. We extend this analogy to jams of mixtures of…
Application partitioning and code offloading are being researched extensively during the past few years. Several frameworks for code offloading have been proposed. However, fewer works attempted to address issues occurred with its…
The high-pressure compaction of three dimensional granular packings is simulated using a bonded particle model (BPM) to capture linear elastic deformation. In the model, grains are represented by a collection of point particles connected by…