Answers are grounded in this paper and cite their sources.
We prove that the unit-rate transposition Laplacian on permutations of m >= 4 symbols avoiding t specified fixed points has spectral gap at least max{1, m-min(t,4)}. For the walk that holds with probability 1/2 and otherwise proposes a uniformly chosen transposition, rejecting a forbidden result, the gap is therefore at least max{1, m-min(t,4)}/[2 binom(m,2)]. With exactly two forbidden fixed points, the unit-rate gap is exactly m-2 for every m >= 3. With three it is exactly (3(m-2)-sqrt((m-2)^2+8))/2 for every m >= 4; the matching lower bound uses an exact computer-algebra certificate. The manuscript, its exact verification and the computer-algebra certificate were produced with AI assistance; the release includes written proofs, exact certificates and the ancillary programs.
No takes yet. Share an insight, caveat, or question.
Mark T. Short (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: