Work

Shortest transfers in two families of fixed-width rook classes

Year: 2026
Type: preprint
Abstract: A legal transfer moves cells between two columns of a Ferrers board, preserving the number of columns and all its rook numbers. We determine all pairwise distances for two families supported on three consecutive root values. In the first, the middle value occurs once. 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)+\mathbf{1}_{a\ne 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 family, two unrestricted swaps can require arbitrarily many legal transfers. In the second family the middle value occurs twice and the largest once. Every realizable class is connected and has diameter three, apart from a single-edge case. Cliques indexed by the position of the largest root, together with a Johnson graph when that root can come first, give an explicit shortest sequence for every pair.
Author: Xu, Zihuan
Language: English
Open Access status: green
OpenAlex ID: W7236860565
Cites:
Cited by:
Related to: 10