The lower-central-series comparison conjecture for random Cayley graphs

About 5 years old · traced to

Let GG be a group with lower central series (Gℓ)ℓ≥0(G_\ell)_{\ell\geq 0}, and let

L=min⁡{ℓ≥0∣Gℓ={id}}.L=\min\{\ell\geq 0\mid G_\ell=\{\mathsf{id}\}\}.

Write the prime decomposition of ∣GL∣|G_L| as ∣GL∣=∏j=1rpj|G_L|=\prod_{j=1}^r p_j, and define

G‾=(⨁ℓ=1LGℓ−1/Gℓ)⊕(⨁j=1rZpj).\overline G=\left(\bigoplus_{\ell=1}^{L}G_{\ell-1}/G_\ell\right)\oplus\left(\bigoplus_{j=1}^{r}\mathbb{Z}_{p_j}\right).

Lower-central-series comparison conjecture. If

1≪log⁡k≪log⁡∣G∣,k−d(G‾)≫1,1\ll\log k\ll\log|G|,\qquad k-d(\overline G)\gg 1,

then, with high probability,

tmix(Gk)tmix(G‾k)≤1+o(1).\frac{t_{\mathrm{mix}}(G_k)}{t_{\mathrm{mix}}(\overline G_k)}\leq 1+o(1).

This extends the paper's nilpotent and Abelian comparison results and contains Wilson's conjecture as a special case. The general comparison remains open.

References

Primary source

Jonathan Hermon and Sam Olesker-Taylor, “Cutoff for Almost All Random Walks on Abelian Groups”, arXiv:2102.02809 (2025).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.