English

Hard squares on cylinders revisited

Combinatorics 2012-04-17 v2

Abstract

We consider the independence complexes of square grids with cylindrical boundary conditions. When one of the dimensions is small we use simple reductions induced by edge removals to show explicit natural homotopy equivalences between those spaces. In the second part we expand the results of Jonsson, who calculated the Euler characteristic of cylinders with odd circumference. We describe a series of results for cylinders of even circumference. Finally we define a completely independent combinatorial model (necklaces) which calculates the generating functions of the Euler characteristic of cylindrical grids. We conjecture that this model has some particularly simple structure.

Keywords

Cite

@article{arxiv.1202.1655,
  title  = {Hard squares on cylinders revisited},
  author = {Michal Adamaszek},
  journal= {arXiv preprint arXiv:1202.1655},
  year   = {2012}
}

Comments

V2: added references

R2 v1 2026-06-21T20:16:26.818Z