Fill's characterization conjecture for minimizers of the adjacent-transposition spectral gap

From papers

Let n3n\geq 3, let p\vec{p} be a regular parameter vector, and let K(p)K(\vec{p}) be the transition matrix of the corresponding adjacent-transposition walk. Let λK(p)\lambda_{K(\vec{p})} be its spectral gap, let punif\vec{p}_{\mathrm{unif}} be the uniform parameter vector, and write

λ=λK(punif).\lambda_* = \lambda_{K(\vec{p}_{\mathrm{unif}})}.

A label c[n]c\in[n] is neutral if

pc,i=pi,c=1/2for all ic.p_{c,i}=p_{i,c}=1/2\qquad\text{for all }i\neq c.

Fill's characterization conjecture. The following are equivalent:

  1. λK(p)=λ\lambda_{K(\vec{p})}=\lambda_* .
  2. p\vec{p} has a neutral label.

The implication from a neutral label to equality is straightforward, but the converse remains the main open content of the conjecture. The restriction n3n\geq 3 is necessary: for n=2n=2, every regular parameter vector has the same spectral gap, whereas a neutral label need not exist.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Vishesh Jain and Clayton Mizgerd, “Equality in Fill's spectral gap problem”, arXiv:2604.03937 (2026).

Solutions 0

No solutions have been posted yet.