Counting domino tilings of rectangles via resultants
The ``cosine formula discovered independently in 1961 by P. W. Kasteleyn and by the reviewer and \textit{M. Fisher} [Philos. Mag., VIII. Ser. 6, 1061-1063 (1961; Zbl 0126.25102)] for the number of domino tilings of a rectangle is related to other combinatorial results such as the enumeration of domino ``heaps which are also related to Chebyshev polynomials (which enumerate Dyck or Motzkin paths on a certain lattice) and pairs of complementary path systems are related to systems of trivial heaps by a determinantal product described as the resultant.NEWLINENEWLINENEWLINENo proofs of the many results and relationships quoted are given but are ``illustrated by a typical example, or the literature is referred to.
- A Robinson-Schensted algorithm for a class of partial orders
- Binomial determinants, paths, and hook length formulae
- Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
- Combinatorial methods
- Combinatorial problems of commutation and rearrangements
- Combinatorics on traces
- Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function
- Dimer problem in statistical mechanics-an exact result
- Enumeration of pairs of sequences by rises, falls and levels
- Generating functions for plane partitions of a given shape
- scientific article; zbMATH DE number 4002104 (Why is no real title available?)
- scientific article; zbMATH DE number 4085660 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 48688 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1405497 (Why is no real title available?)
- scientific article; zbMATH DE number 3227563 (Why is no real title available?)
- scientific article; zbMATH DE number 4183442 (Why is no real title available?)
- Matching theory
- On a strange observation in the theory of the dimer problem
- On dimer coverings of rectangles of fixed width
- On the Vector Representations of Induced Matroids
- Permutations with restricted patterns and Dyck paths
- Remark on the dimer problem
- Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type
- The Rogers-Ramanujan reciprocal and Minc's partition function
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Domino tilings of Aztec diamonds and squares
- On dimer coverings of rectangles of fixed width
- Singular polynomials of generalized Kasteleyn matrices
- Calculation of Pfaffians by a chip removal
- Automatic counting of tilings of skinny plane regions
- scientific article; zbMATH DE number 6670068 (Why is no real title available?)
- Fibonacci polynomials: compositions and cyclic products
- scientific article; zbMATH DE number 7298071 (Why is no real title available?)
- Mutually-recursive formulas for enumerating partitions of the rectangle
- The asymptotic determinant of the discrete Laplacian
- A reciprocity theorem for domino tilings
- Acyclic orientations and the chromatic polynomial
- Generalized Schröder paths arising from a combinatorial interpretation of generalized Laurent bi-orthogonal polynomials
- Generalizing the divisibility property of rectangle domino tilings
This page was built for publication: Counting domino tilings of rectangles via resultants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5956784)