A Bijection Proving the Aztec Diamond Theorem by Combing Lattice Paths.¶
Bosio, F., & Van Leeuwen, M. A. A. (2013). A Bijection Proving the Aztec Diamond Theorem by Combing Lattice Paths. The Electronic Journal of Combinatorics, 20(4).
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Domain-specific¶
- Aztec Diamond
- Bijective combinatorics. The reversible shuffle exposes n new binary choices at growth step n. Bosio and van Leeuwen give an invertible combing algorithm between appropriate path families, another route to the same enumeration.
This sourceGives an invertible path-family proof of the power-of-two enumeration.
- Bijective combinatorics. The reversible shuffle exposes n new binary choices at growth step n. Bosio and van Leeuwen give an invertible combing algorithm between appropriate path families, another route to the same enumeration.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:7d874a9651b9 · see in the full table