ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Γn(1,n/2−1)\Gamma_n(1,n/2-1) be the cyclically presented group in the source, let Γn(1,n/2−1)ab\Gamma_n(1,n/2-1)^\mathrm{ab} denote its abelianisation, and let d(G)d(G) be the minimum number of generators of a finite abelian group GG. Generator-number conjecture. Suppose (n,6)=2(n,6)=2 and n≥8n\geq 8. Then

d(Γn(1,n/2−1)ab)={1if (n,16)=2,2if (n,16)=4 or 16,3if (n,16)=8.d(\Gamma_n(1,n/2-1)^\mathrm{ab})=\begin{cases}1&\mathrm{if}~(n,16)=2,\\2&\mathrm{if}~(n,16)=4~\mathrm{or}~16,\\3&\mathrm{if}~(n,16)=8.\end{cases}

The conjecture was verified computationally using GAP for n≤500n\leq 500; the paper notes that the third case also has an established lower bound of three, while the remaining cases are not proved there.

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.