King and domino polynomials for polyomino graphs
Authors:
- 1 July 1977
- journal article
- conference paper
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 18 (7) , 1485-1490
Abstract
For the purposes of treating several enumeration problems of lattice dynamics, king and domino polynomials are defined for a chessboard, polyomino, or square lattice of arbitrary size and shape. These polynomials are shown to be closely related to the partition function of the dimer statistics, the number of Kekulé structures, or maximum matching number. Several recursion formulas are found. Interpretation of these newly proposed quantities is given, and the possibility of extending them to the important physical models is discussed.Keywords
This publication has 10 references indexed in Scilit:
- A topological index for the total?-electron energyTheoretical Chemistry Accounts, 1975
- Occupation statistics from exact recursion relations for occupation by dumbbells of a 2 × N arrayJournal of Mathematical Physics, 1974
- Exact formulas for 2 × n arrays of dumbbellsJournal of Mathematical Physics, 1974
- Exact parastatistics for one-dimensional lattice spaceJournal of Mathematical Physics, 1973
- Occupation Statistics for Parallel Dumbbells on a 2 × N Lattice SpaceJournal of Mathematical Physics, 1972
- Topological Index. A Newly Proposed Quantity Characterizing the Topological Nature of Structural Isomers of Saturated HydrocarbonsBulletin of the Chemical Society of Japan, 1971
- Exact occupation statistics for one-dimensional arrays ofλ-bellsIl Nuovo Cimento B (1971-1996), 1968
- Exact Occupation Statistics for One-Dimensional Arrays of DumbbellsJournal of Mathematical Physics, 1967
- The statistics of dimers on a latticePhysica, 1961
- Dimer problem in statistical mechanics-an exact resultPhilosophical Magazine, 1961