Extremal values of semi-regular continuants and codings of interval exchange transformations

The paper proves, with a complete combinatorial–dynamical argument, that among all permutations of a ternary multiset an1_1 an2_2 an3_3 (2 ≤ a1 < a2 < a3) there is a unique maximizer (up to reversal) for the semi-regular continuant, and that this maximizer depends only on (n1,n2,n3), not on the values a1,a2,a3. It also gives an explicit construction algorithm and shows the statement fails for alphabets of size ≥4. The candidate solution establishes standard continuant identities and a bi-affine swap formula but does not provide the crucial, value-independent monotonicity proof (uniform sign control for the swap gain) needed to conclude that a prescribed sequence of swaps always increases the continuant and leads to a canonical maximizer. Hence the candidate solution is incomplete, while the paper’s result and proof are correct.