Complexity Function of Jammed Configurations of Rydberg Atoms
From MaRDI portal
Exact enumeration problems, generating functions (05A15) Asymptotic enumeration (05A16) Combinatorial aspects of packing and covering (05B40) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20)
Abstract: In this article, we determine the complexity function (configurational entropy) of jammed configurations of Rydberg atoms on a one-dimensional lattice. Our method consists of providing asymptotics for the number of jammed configurations determined by direct combinatorial reasoning. In this way we reduce the computation of complexity to solving a constrained optimization problem for the Shannon's entropy function. We show that the complexity can be expressed explicitly in terms of the root of a certain polynomial of degree , where is the so-called blockade range of a Rydberg atom. Our results are put in a relation with the model of irreversible deposition of -mers on a one-dimensional lattice.
This page was built for publication: Complexity Function of Jammed Configurations of Rydberg Atoms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426776)
