Published November 8, 1997
| Published
Journal Article
Open
Combinatorial Approaches and Conjectures for 2-Divisibility Problems Concerning Domino Tilings of Polyominoes
- Creators
-
Pachter, Lior
Chicago
An error occurred while generating the citation.
Abstract
We give the first complete combinatorial proof of the fact that the number of domino tilings of the 2n×2n square grid is of the form 2^n(2k + 1)^2, thus settling a question raised by John, Sachs, and Zernitz. The proof lends itself naturally to some interesting generalizations, and leads to a number of new conjectures.
Additional Information
© 1997 The Author. Submitted: September 24, 1997; Accepted: November 8, 1997. We thank Joshua Bao and Jim Propp for helpful suggestions and comments. Special thanks go to Glenn Tesler for helping to draw the tiling pictures and to David Wilson for providing his program vax.el with which all the conjectures were tested. Finally, we are indebted to the anonymous referee for excellent suggestions which greatly helped in improving the final version of the paper.Attached Files
Published - 1314-1393-1-PB.pdf
Files
1314-1393-1-PB.pdf
Files
(115.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:90d6b05b5a7b930df99ce575b9c3db52
|
115.8 kB | Preview Download |
Additional details
- Eprint ID
- 75001
- Resolver ID
- CaltechAUTHORS:20170309-144854496
- Created
-
2017-03-13Created from EPrint's datestamp field
- Updated
-
2020-02-24Created from EPrint's last_modified field