Can I read Combinatorial Proofs for Domino Tilings on EtoBox?

Combinatorial Proofs for Domino Tilings by Harold Hardy Godfrey is a document available to read on EtoBox.

What is Combinatorial Proofs for Domino Tilings about?

The document provides a combinatorial proof that the number of domino tilings of the 2n x 2n square grid is of the form 2n(2k+1)2, settling an open question. It introduces relevant notation and concepts. It then proves this through three lemmas: 1) the number of tilings depends only on domino orientation, not direction; 2) the number of tilings is equal to 2n times the square of the number of tilings of a region Hn; and 3) the number of tilings of Hn is odd.

Author

Harold Hardy Godfrey

Language

EN