ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime, let mm be a positive integer, and let G(r,p)G(r,p) be the subgroup of Sr\mathsf{S}_r generated by the elements π(r,s,p)\pi(r,s,p) for s⩾rs\geqslant r. Define

Σ:={π(r,s,p):r⩽s⩽r+pm−1}.\Sigma:=\{\pi(r,s,p): r\leqslant s\leqslant r+p^m-1\}.

Generating-set size conjecture. The generating set Σ\Sigma has at most 2r2r distinct elements for each prime pp, and

lim⁡r→∞∣Σ∣2r=1.\lim_{r\to\infty}\frac{|\Sigma|}{2r}=1.

This concerns the size of the finite generating set obtained from the periodicity of the generators π(r,s,p)\pi(r,s,p). The supplied text does not indicate whether the assertion has been proved or remains open.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.