ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be prime, let G=(Cp)nG=(C_p)^n, and let (nk)p\binom{n}{k}_p denote the Gaussian binomial coefficient, counting the subgroups of CpnC_p^n isomorphic to CpkC_p^k. Let c(G)\mathfrak{c}(G) denote the complexity. Elementary-abelian complexity conjecture.

c(G)={∑i=0n−12(nn−i)p(n−ii)pn odd,∑i=0n2−1(nn−i)p(n−ii)pn⩾6 even,∑i=0n2−1(ni)p(n−ii+1)pn=2,4.\mathfrak{c}(G)=\begin{cases} \displaystyle\sum_{i=0}^{\frac{n-1}{2}}\binom{n}{n-i}_p\binom{n-i}{i}_p & n\text{ odd},\\[6pt] \displaystyle\sum_{i=0}^{\frac{n}{2}-1}\binom{n}{n-i}_p\binom{n-i}{i}_p & n\geqslant6\text{ even},\\[6pt] \displaystyle\sum_{i=0}^{\frac{n}{2}-1}\binom{n}{i}_p\binom{n-i}{i+1}_p & n=2,4. \end{cases}

The conjecture is based on computational evidence and predicts a change in behavior at n=6n=6 for even ranks.

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.