Sharp lower bound on the spectral gap of biased adjacent-transposition chains on the symmetric group is established, resolving Fill's conjecture with characterization of minimizers and eigenvalue multiplicity.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Spectral gap of biased adjacent-transposition chains
Sharp lower bound on the spectral gap of biased adjacent-transposition chains on the symmetric group is established, resolving Fill's conjecture with characterization of minimizers and eigenvalue multiplicity.