Bijections on m-level Rook Placements
Partition the rows of a board into sets of $m$ rows called levels. An $m$-level rook placement is a subset of squares of the board with no two in the same column or the same level. We construct explicit bijections to prove three theorems about such placements. We start with two bijections between Fe...
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Julkaistu: |
Discrete Mathematics & Theoretical Computer Science
2014-01-01
|
| Sarja: | Discrete Mathematics & Theoretical Computer Science |
| Aiheet: | |
| Linkit: | https://dmtcs.episciences.org/2430/pdf |