The mod-2 persistence conjecture for prefix-reversal generating triples

From papers

Let n,m,kn,m,k be integers with 2k<m<n2\leqslant k<m<n. Mod-2 persistence conjecture. For any n0,1(mod4)n\equiv0,1\pmod{4}, if

rn,rm,rk=Symn,\langle r_n,r_m,r_k\rangle=\operatorname{Sym}_n,

then

rn+2,rm+2,rk+2=Symn+2.\langle r_{n+2},r_{m+2},r_{k+2}\rangle=\operatorname{Sym}_{n+2}.

This was proposed from computational experiments for n100n\leqslant100; no proof or resolution is given.

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

Saúl A. Blanco, Mikhail P. Golubyatnikov, Elena V. Konstantinova, Natalia V. Maslova and Luka A. Nikiforov, “Generating the symmetric group by three prefix reversals”, arXiv:2511.16959 (2025).

Solutions 0

No solutions have been posted yet.