Tiling Parity Results and the Holey Square Solution

Simple item page
dc.creatorTenner, Bridget Eileen
dc.date2004-09-07
dc.date2004-10-07
dc.date.accessioned2026-07-07T05:11:52Z
dc.date.available2026-07-07T05:11:52Z
dc.descriptionWe prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We furthermore give combinatorial proofs of several other tiling parity results, including that the number of domino tilings of a particular family of rectangles is always odd.
dc.description12 pages. Generalized parity theorem and new corollaries
dc.identifierhttps://arxiv.org/abs/math/0409105
dc.identifierhttp://arxiv.org/abs/math/0409105
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72392
dc.subjectCombinatorics
dc.subject05B45; 05C70
dc.titleTiling Parity Results and the Holey Square Solution
dc.typetext

Files

Collections

arXiv