Computations versus bijections for tiling enumeration
type: Item
instance of: scholarly article
title: Computations versus bijections for tiling enumeration
zbMATH Open document ID: 1498.05018
author: Ilse Fischer
published in: Advances in Applied Mathematics
publication date: 2022-09-30T00:00:00Z
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 05A19
zbMATH DE Number: 7595586
zbMATH Keywords: number of domino tilings of an Aztec rectangle
zbMATH Keywords: signed enumeration
zbMATH Keywords: restricted straight enumeration
MaRDI profile type: Publication
full work available at URL: j.aam.2022.102427
OpenAlex ID: W4294795229
cites work: Perfect matchings of cellular graphs
cites work: Alternating-sign matrices and domino tilings. I
cites work: Alternating-sign matrices and domino tilings. II
cites work: A method for proving polynomial enumeration formulas
cites work: The number of monotone triangles with prescribed bottom row
cites work: A bijective proof of the ASM theorem. I: The operator formula
cites work: The mysterious story of square ice, piles of cubes, and bijections
cites work: A Bijective Proof of the ASM Theorem Part II: ASM Enumeration and ASM–DPP Relation
cites work: Method for constructing bijections for classical partition identities
cites work: A Rogers-Ramanujan bijection
cites work: Q3836516
cites work: Another involution principle-free bijective proof of Stanley's hook-content formula
cites work: Double Aztec rectangles
cites work: Alternating sign matrices and descending plane partitions
cites work: Generalized domino-shuffling.
cites work: A bijective proof of the Hook formula for the number of column strict tableaux with bounded entries
cites work: Q4236280
DOI: 10.1016/J.AAM.2022.102427
description: scientific article; zbMATH DE number 7595586