Upper bounds on the growth rates of hard squares and related models via corner transfer matrices
We study the growth rate of the hard squares lattice gas, equivalent to the number of independent sets on the square lattice, and two related models — non-attacking kings and read-write isolated memory. We use an assortment of techniques from combinatorics, statistical mechanics and linear algebra...
Main Author: | Yao-Ban Chan |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2015-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/2486/pdf |
Similar Items
-
New Upper Bounds for the Heights of Some Light Subgraphs in 1-Planar Graphs with High Minimum Degree
by: Xin Zhang, et al.
Published: (2011-09-01) -
Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01) -
Cycle transversals in bounded degree graphs
by: Marina Groshaus, et al.
Published: (2011-03-01) -
Latin square Thue-Morse sequences are overlap-free
by: C. Robinson Tompkins
Published: (2007-01-01) -
A lower bound for approximating the Grundy number
by: Guy Kortsarz
Published: (2007-01-01)