Inversion relations, reciprocity and polyominoes

DOI10.1007/BF01608785zbMATH Open0937.05005arXivmath/9908123MaRDI QIDQ1306597FDOQ1306597

Authors: Mireille Bousquet-Mélou, Anthony J Guttmann, W. P. Orrick, Andrew Rechnitzer 

Publication date: 7 June 2000

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

Abstract: We derive self-reciprocity properties for a number of polyomino generating functions, including several families of column-convex polygons, three-choice polygons and staircase polygons with a staircase hole. In so doing, we establish a connection between the reciprocity results known to combinatorialists and the inversion relations used by physicists to solve models in statistical mechanics. For several classes of convex polygons, the inversion (reciprocity) relation, augmented by certain symmetry and analyticity properties, completely determines the anisotropic perimeter generating function.

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

Recommendations

• Generating functions for inscribed polyominoes
• Combinatorics of diagonally convex directed polyominoes
• On some classes of inverse series relations and their applications
• scientific article; zbMATH DE number 38124

zbMATH Keywords

Potts modelpolyominoreciprocity relationssymmetry relationsinversion relations

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (8)

• Concatenation arguments and their applications to polyominoes and polycubes
• Haruspicy and anisotropic generating functions
• Haruspicy 2: The anisotropic generating function of self-avoiding polygons is not D-finite
• Lattice paths: Vicious walkers and friendly walkers
• Brick wall diagrams as a completely integrable system
• Why are so many problems unsolved?
• Clusters of cycles
• The anisotropic generating function of self-avoiding polygons is not D-finite

This page was built for publication: Inversion relations, reciprocity and polyominoes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306597)