Some 2-adic conjectures concerning polyomino tilings of Aztec diamonds
Abstract
For various sets of tiles, we count the ways to tile an Aztec diamond of order n using tiles from that set. The resulting function f(n) often has interesting behavior when one looks at n and f(n) modulo powers of 2.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.