Dense packing on uniform lattices

Details Dense packing on uniform lattices Dense packing on uniform lattices

2009-07-24

arxiv.org/abs/0907.4247v1

J. of Stat. Phys., 130, no. 4, pp. 741-55, 2008

Physics

Mathematical Physics

18 pages

Scientific paper

We study the Hard Core Model on the graphs ${\rm {\bf \scriptstyle G}}$ obtained from Archimedean tilings i.e. configurations in $\scriptstyle \{0,1\}^{{\rm {\bf G}}}$ with the nearest neighbor 1's forbidden. Our particular aim in choosing these graphs is to obtain insight to the geometry of the densest packings in a uniform discrete set-up. We establish density bounds, optimal configurations reaching them in all cases, and introduce a probabilistic cellular automaton that generates the legal configurations. Its rule involves a parameter which can be naturally characterized as packing pressure. It can have a critical value but from packing point of view just as interesting are the noncritical cases. These phenomena are related to the exponential size of the set of densest packings and more specifically whether these packings are maximally symmetric, simple laminated or essentially random packings.

Affiliated with

Also associated with

No associations

Rating

Dense packing on uniform lattices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dense packing on uniform lattices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dense packing on uniform lattices will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-309436