Related papers: Comment on "Explicit Analytical Solution for Rando…
We report a numerical calculation of the total number of disordered jammed configurations $\Omega$ of $N$ repulsive, three-dimensional spheres in a fixed volume $V$. To make these calculations tractable, we increase the computational…
Entanglement entropies have revealed, in the last years, to be a powerful tool to extract information about the physics of condensed-matter systems. In the first part of this thesis, we show how to extract essential details about the…
In this paper I will approach the computation of the maximum density of regular lattices in large dimensions using a statistical mechanics approach. The starting point will be some theorems of Roger, which are virtually unknown in the…
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,…
We investigate approximation algorithms for several fundamental optimization problems on geometric packing. The geometric objects considered are very generic, namely $d$-dimensional convex fat objects. Our main contribution is a versatile…
We want to approximate general multivariate probability density functions by deterministic sample sets. For optimal sampling, the closeness to the given continuous density has to be assessed. This is a difficult challenge in multivariate…
Recent theoretical advances offer an exact, first-principle theory of jamming criticality in infinite dimension as well as universal scaling relations between critical exponents in all dimensions. For packings of frictionless spheres near…
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 revisit the deadline version of the discrete time-cost tradeoff problem for the special case of bounded depth. Such instances occur for example in VLSI design. The depth of an instance is the number of jobs in a longest chain and is…
In this paper, we study randomized reduction methods, which reduce high-dimensional features into low-dimensional space by randomized methods (e.g., random projection, random hashing), for large-scale high-dimensional classification.…
A stochastic PDE, describing mesoscopic fluctuations in systems of weakly interacting inertial particles of finite volume, is proposed and analysed in any finite dimension $d\in\mathbb{N}$. It is a regularised and inertial version of the…
We study tight projective 2-designs in three different settings. In the complex setting, Zauner's conjecture predicts the existence of a tight projective 2-design in every dimension. Pandey, Paulsen, Prakash, and Rahaman recently proposed…
Dimension reduction is widely regarded as an effective way for decreasing the computation, storage and communication loads of data-driven intelligent systems, leading to a growing demand for statistical methods that allow analysis (e.g.,…
We present a self-consistent framework to perform the wavelet analysis of two-dimensional statistical distributions. The analysis targets the 2D probability density function (p.d.f.) of an input sample, in which each object is characterized…
We have formulated the problem of generating periodic dense paritcle packings as an optimization problem called the Adaptive Shrinking Cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E {\bf 80}, 041104 (2009)]. Because the…
We study the two-dimensional (geometric) knapsack problem with rotations (2DKR), in which we are given a square knapsack and a set of rectangles with associated profits. The objective is to find a maximum profit subset of rectangles that…
Understanding the structural evolution of granular systems is a long-standing problem. A recently proposed theory for such dynamics in two dimensions predicts that steady states of very dense systems satisfy detailed-balance. We analyse…
We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…
In this letter, we used a combination of DEM and the multi-sphere method to investigate the random packing dynamics of $\Sigma_{2v}(2\pi/3)$-triplets. These triplets consist of three overlapping primary spheres, forming a bent structure…
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…