Counting domino tilings of rectangles via resultants
From MaRDI portal
Publication:5956784
DOI10.1006/aama.2001.0752zbMath0994.05051OpenAlexW2063416345MaRDI QIDQ5956784
Publication date: 10 October 2002
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/aama.2001.0752
Related Items (4)
Calculation of Pfaffians by a chip removal ⋮ Fibonacci polynomials: compositions and cyclic products ⋮ Acyclic orientations and the chromatic polynomial ⋮ Domino tilings of Aztec diamonds and squares
Cites Work
- The Rogers-Ramanujan reciprocal and Minc's partition function
- Binomial determinants, paths, and hook length formulae
- Matching theory
- Combinatorics on traces
- Enumeration of pairs of sequences by rises, falls and levels
- Remark on the dimer problem
- Short and easy computer proofs of the Rogers-Ramanujan identities and of identities of similar type
- A Robinson-Schensted algorithm for a class of partial orders
- Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
- On a strange observation in the theory of the dimer problem
- On dimer coverings of rectangles of fixed width
- Descents, quasi-symmetric functions, Robinson-Schensted for posets, and the chromatic symmetric function
- Generating functions for plane partitions of a given shape
- Combinatorial problems of commutation and rearrangements
- Combinatorial methods
- The statistics of dimers on a lattice
- Dimer problem in statistical mechanics-an exact result
- On the Vector Representations of Induced Matroids
- Permutations with restricted patterns and Dyck paths
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Counting domino tilings of rectangles via resultants
