TOPICS
Search

Hard Hexagon Entropy Constant

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

Consider an n×n (0, 1)-matrix such as

[a_(11) a_(23) ; a_(22) a_(34); a_(21) a_(33) ; a_(32) a_(44); a_(31) a_(43) ; a_(42) a_(54); a_(41) a_(53) ; a_(52) a_(64)]
(1)

for n=4. Call two elements a_(ij) adjacent if they lie in positions (i,j) and (i+1,j), (i,j) and (i,j+1), or (i,j) and (i+1,j+1) for some i,j. Call G(n) the number of such arrays with no pairs of adjacent 1s. Equivalently, G(n) is the number of configurations of nonattacking kings on an n×n chessboard with regular hexagonal cells.

The first few values of G(n) for n=1, 2, ... are 2, 6, 43, 557, 14432, ... (OEIS A066863).

The hard square hexagon constant is then given by

kappa_h=lim_(n->infty)[G(n)]^(1/n^2)
(2)
=1.395485972...
(3)

(OEIS A085851).

Amazingly, kappa_h is algebraic and is given by

kappa_h=kappa_1kappa_2kappa_3kappa_4,
(4)

where

kappa_1=4^(-1)3^(5/4)11^(-5/12)c^(-2)
(5)
kappa_2=[1-sqrt(1-c)+sqrt(2+c+2sqrt(1+c+c^2))]^2
(6)
kappa_3=[-1-sqrt(1-c)+sqrt(2+c+2sqrt(1+c+c^2))]^2
(7)
kappa_4=[sqrt(1-a)+sqrt(2+a+2sqrt(1+a+a^2))]^(-1/2)
(8)
a=-(124)/(363)11^(1/3)
(9)
b=(2501)/(11979)33^(1/2)
(10)
c={1/4+3/8a[(b+1)^(1/3)-(b-1)^(1/3)]}^(1/3).
(11)

(Baxter 1980, Joyce 1988ab).

The variable c can be expressed in terms of the tribonacci constant

t=(x^3-x^2-x-1)_1,
(12)

where (P(x))_n is a polynomial root, as

c=[1/4-(31(13t+81))/(242(32t+7))]^(1/3)
(13)
=[1/4-(31(32t^2-39t-19))/(2662)]^(1/3)
(14)
=(10307264x^9-7730448x^6+3839236x^3-161051)_1
(15)

(T. Piezas III, pers. comm., Feb. 11, 2006).

Explicitly, kappa is the unique positive root

kappa_h=(25937424601z^(24)+2013290651222784z^(22)+2505062311720673792z^(20)+797726698866658379776z^(18)+7449488310131083100160z^(16)+2958015038376958230528z^(14)-72405670285649161617408z^(12)+107155448150443388043264z^(10)-71220809441400405884928z^8-73347491183630103871488z^6+97143135277377575190528z^4-32751691810479015985152)_2,
(16)

where (P(x))_n denotes the nth root of the polynomial P(x) in the ordering of the Wolfram Language.

See also

Hard Square Entropy Constant, Kings Problem, Tribonacci Constant

Explore with Wolfram|Alpha

References

Baxter, R. J. "Hard Hexagons: Exact Solution." J. Physics A 13, 1023-1030, 1980.Baxter, R. J. Exactly Solved Models in Statistical Mechanics. New York: Academic Press, 1982.Finch, S. R. "Hard Square Entropy Constant." §5.12 in Mathematical Constants. Cambridge, England: Cambridge University Press, pp. 342-349, 2003.Joyce, G. S. "On the Hard Hexagon Model and the Theory of Modular Functions." Phil. Trans. Royal Soc. London A 325, 643-702, 1988a.Joyce, G. S. "Exact Results for the Activity and Isothermal Compressibility of the Hard-Hexagon Model." J. Phys. A: Math. Gen. 21, L983-L988, 1988b.Katzenelson, J. and Kurshan, R. P. "S/R: A Language for Specifying Protocols and Other Coordinating Processes." In Proc. IEEE Conf. Comput. Comm., pp. 286-292, 1986.Sloane, N. J. A. Sequences A066863 and A085851 in "The On-Line Encyclopedia of Integer Sequences."

Referenced on Wolfram|Alpha

Hard Hexagon Entropy Constant

Cite this as:

Weisstein, Eric W. "Hard Hexagon Entropy Constant." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/HardHexagonEntropyConstant.html

Subject classifications