We determine the asymptotic behavior of the entropy of full coverings of a L×M square lattice by rods of size k×1 and 1×k, in the limit of large k. We show that full coverage is possible only if at least one of L and M is a multiple of k, and that all allowed configurations can be reached from a standard configuration of all rods being parallel, using only basic flip moves that replace a k×k square of parallel horizontal rods by vertical rods, and vice versa. In the limit of large k, we show that the entropy per site S_{2}(k) tends to Ak^{-2}lnk, with A=1. We conjecture, based on a perturbative series expansion, that this large-k behavior of entropy per site is superuniversal and continues to hold on all d-dimensional hypercubic lattices, with d≥2.

Download full-text PDF

Source
http://dx.doi.org/10.1103/PhysRevE.103.042130DOI Listing

Publication Analysis

Top Keywords

d-dimensional hypercubic
8
hypercubic lattices
8
behavior entropy
8
limit large
8
entropy site
8
rods
5
entropy
4
entropy fully
4
fully packed
4
packed hard
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!