Inversion relations, reciprocity and polyominoes

DOI10.1007/BF01608785zbMath0937.05005arXivmath/9908123MaRDI QIDQ1306597

Andrew Rechnitzer, Anthony J. Guttmann, Mireille Bousquet-Mélou, William P. Orrick

Publication date: 7 June 2000

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9908123

zbMATH Keywords

Potts modelpolyominoreciprocity relationssymmetry relationsinversion relations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Exactly solvable models; Bethe ansatz (82B23) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Polyominoes (05B50)

Related Items

Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite, Lattice paths: Vicious walkers and friendly walkers, Haruspicy and anisotropic generating functions, Brick wall diagrams as a completely integrable system, Concatenation arguments and their applications to polyominoes and polycubes, Why Are So Many Problems Unsolved?, The Anisotropic Generating Function of Self-Avoiding Polygons is not D-Finite, Clusters of cycles

Cites Work

• Unnamed Item
• Unnamed Item
• The number of three-choice polygons
• Linear Diophantine equations and local cohomology
• From the Bethe Ansatz to the Gessel-Viennot theorem
• A method for the enumeration of various classes of column-convex polygons
• Combinatorial Problems Suggested by the Statistical Mechanics of Domains and of Rubber-Like Molecules
• Convex polyominoes and heaps of segments
• Punctured polygons and polyominoes on the square lattice
• Crystal Statistics. I. A Two-Dimensional Model with an Order-Disorder Transition
• Combinatorial reciprocity theorems