Related papers: Random perfect lattices and the sphere packing pro…
We study the 2D Ising model on three different types of lattices that are topologically equivalent to spheres. The geometrical shapes are reminiscent of the surface of a pillow, a 3D cube and a sphere, respectively. Systems of volumes…
While planar Fermi superfluids form Abrikosov vortex lattices under magnetic or effective gauge fields, spherical geometry forbids perfect lattices above 20 vortices. We characterize approximate vortex structures of atomic Fermi superfluids…
Fully packed loop models describe the statistics of closely packed nested polygons on the square lattice. Many exact results can be obtained for these models, even for finite geometries, using their close relationship to alternating-sign…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
Among the family of hard convex lens-shaped particles (lenses), the one with aspect ratio equal to 2/3 is `optimal' in the sense that the maximally random jammed (MRJ) packings of such lenses achieve the highest packing fraction $\phi_{\rm…
We discuss recently introduced numerical linked-cluster (NLC) algorithms that allow one to obtain temperature-dependent properties of quantum lattice models, in the thermodynamic limit, from exact diagonalization of finite clusters. We…
Sphere packing, Hilbert's eighteenth problem, asks for the densest arrangement of congruent spheres in n-dimensional Euclidean space. Although relevant to areas such as cryptography, crystallography, and medical imaging, the problem remains…
We suggest a method for embedding scale-free networks, with degree distribution P(k) k^-lambda, in regular Euclidean lattices. The embedding is driven by a natural constraint of minimization of the total length of the links in the system.…
Particle delocalization is a common feature of quantum random walks in arbitrary lattices. However, in the typical scenario a particle spreads over multiple sites and its evolution is not directly useful for controlled quantum…
Optical lattices serve as fundamental building blocks for atomic quantum technology. However, the scale and resolution of these lattices are diffraction-limited to the light wavelength. In conventional lattices, achieving tight confinement…
Let $\mathrm{Sym}_q(m)$ be the space of symmetric matrices in $\mathbb{F}_q^{m\times m}$. A subspace of $\mathrm{Sym}_q(m)$ equipped with the rank distance is called a symmetric rank-metric code. In this paper we study the covering…
We study the scaling limits of three different aggregation models on the integer lattice Z^d: internal DLA, in which particles perform random walks until reaching an unoccupied site; the rotor-router model, in which particles perform…
Template-based searches for gravitational waves are often limited by the computational cost associated with searching large parameter spaces. The study of efficient template banks, in the sense of using the smallest number of templates, is…
This paper investigates the construction of space-filling designs for computer experiments. The space-filling property is characterized by the covering and separation radii of a design, which are integrated through the unified criterion of…
We study the diffusion process through an ideal polymer network, using numerical methods. Polymers are modeled by random walks on the bonds of a two-dimensional square lattice. Molecules occupy the lattice cells and may jump to the…
Various packing problems and simulations of hard and soft interacting particles, such as microscopic models of nematic liquid crystals, reduce to calculations of intersections and pair interactions between ellipsoids. When constrained to a…
This paper focuses on asymptotic properties of random monomial ideals through a statistical viewpoint. It extends the study of redundancy in monomial ideals by analyzing the poset density of the LCM-lattice. We explore how this density…
Various lattice gas automata have been proposed in the past decades to simulate physics and address a host of problems on collective dynamics arising in diverse fields. In this work, we employ the lattice gas model defined on the sphere to…
This paper introduces the \emph{$d$-distance matching problem}, in which we are given a bipartite graph $G=(S,T;E)$ with $S=\{s_1,\dots,s_n\}$, a weight function on the edges and an integer $d\in\mathbb Z_+$. The goal is to find a maximum…
Particle transport and localization phenomena in condensed-matter systems can be modeled using a tight-binding lattice Hamiltonian. The ideal experimental emulation of such a model utilizes simultaneous, high-fidelity control and readout of…