Metraipolis › archive › dc_67434526b2b2
Non-attacking rook placements on crossword grids — arXiv:2609.03081
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.03081
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T02:33:18.831Z
- SHA-256 of the archived text
3150e90c6aac8b6e2a5cd542054d3a7c266bf57b14e992ac8e2aace495c68a59- Stable URL of this page
https://metraipolis.com/documento/dc_67434526b2b2
How to cite
Non-attacking rook placements on crossword grids — arXiv:2609.03081 — arXiv (en), https://arxiv.org/abs/2609.03081 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_67434526b2b2 (Metraipolis archive dc_67434526b2b2, sha256 3150e90c6aac8b6e2a5cd542054d3a7c266bf57b14e992ac8e2aace495c68a59)
BibTeX
@misc{dc67434526b2b2,
title = {Non-attacking rook placements on crossword grids — arXiv:2609.03081},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.03081},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_67434526b2b2; sha256 3150e90c6aac8b6e2a5cd542054d3a7c266bf57b14e992ac8e2aace495c68a59},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03081. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce the notion of a non-attacking rook placement on a crossword grid. A crossword grid is a collection of white squares (which comprise across and down words) and black squares (which separate the words), and a complete non-attacking rook placement on such a grid is a subset of white squares which intersects every across and every down word exactly once. We prove an upper bound on the number of rook placements that a general grid can admit. We then study sparse grids in which no two black squares share an edge and show that rook placements on certain sparse grids correspond bijectively to alternating sign matrices with prescribed $-1$ entries. Specializing further to permutation grids, we prove that every permutation grid admits at least one rook placement, and characterize the permutations whose grids admit exactly one placement in terms of the Robinson--Schensted correspondence. Throughout, we pose a variety of conjectures and open questions. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.03081 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T02:09:21.171Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).