Shortest transfers in fixed-width rook classes with a single intermediate root
A legal transfer moves cells between two columns of a Ferrers board, preserving the number of columns and all its rook numbers. We determine the distance between every pair of boards for root multisets supported on three consecutive integers with a single copy of the middle value. When the largest root is nonpositive, the graph consists of two cliques with one common vertex and a path attached at each clique vertex. If the smallest and largest roots have multiplicities a, b, its diameter is 2 min(a, b) + 𝟙{a ≠ b}, and a shortest transfer sequence can be read from the two root vectors in linear time. At the remaining realizable offsets all vertices are isolated. Even in this three-value family, two unrestricted swaps can require arbitrarily many legal transfers.
Authors
- Zihuan Xu
Institutions
- Capital Normal University (CN)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-19
- DOI
- https://doi.org/10.5281/zenodo.24364985
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint