Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
type: Item
instance of: scholarly article
title: Combinatorial approaches and conjectures for 2-divisibility problems concerning domino tilings of polyominoes
zbMATH Open document ID: 0886.05046
author: Lior Pachter
published in: The Electronic Journal of Combinatorics
publication date: 1998-02-15T00:00:00Z
full work available at URL: https://eudml.org/doc/119298
full work available at URL: v4i1r29.html
review text: Summary: We give the first complete combinatorial proof of the fact that the number of domino tilings of the \(2n\times 2n\) square grid is of the form \(2^n(2k+ 1)^2\). The proof lends itself naturally to some interesting generalizations, and leads to a number of new conjectures.
Mathematics Subject Classification ID: 05B45
Mathematics Subject Classification ID: 05B50
zbMATH DE Number: 1118013
zbMATH Keywords: domino tilings
zbMATH Keywords: square grid
MaRDI profile type: Publication
Recommended article: Polyomino convolutions and tiling problems
Recommended article: 2-adic behavior of numbers of domino tilings
Recommended article: Some open problems in polyomino tilings
Recommended article: Generalizing the divisibility property of rectangle domino tilings
Recommended article: Tiling with polyominoes and combinatorial group theory
Recommended article: Binomial ideals of domino tilings
Recommended article: Q5239738
Recommended article: Further Combinatorics and Applications of Two-Toned Tilings
Recommended article: Integer Partitions, Tilings of2D-gons and Lattices
Recommended article: Reconstruction of domino tilings -- combinatorial and probabilistic questions
description: scientific article; zbMATH DE number 1118013