ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let pp be a prime satisfying 3∤p−13\nmid p-1, let L(p)L(p) be the piecewise function defined by

L(p)={(p−1)/4if p≡1(mod8),(p+1)/4if p≡3(mod8),(p+3)/4if p≡5(mod8),(p−3)/4if p≡7(mod8),L(p)=\begin{cases}(p-1)/4&\text{if }p\equiv1\pmod 8,\\(p+1)/4&\text{if }p\equiv3\pmod 8,\\(p+3)/4&\text{if }p\equiv5\pmod 8,\\(p-3)/4&\text{if }p\equiv7\pmod 8,\end{cases}

and let U3(p)U_3(p) denote the number of unconnected graphs G(λ,X3+a){\mathcal G}(\lambda,X^3+a) with λ∈Np\lambda\in{\mathbb N}_p and a∈Fp∗a\in{\mathbb F}_p^*. Cubic exact-count conjecture. For any prime p>31p>31 satisfying 3∤p−13\nmid p-1, U3(p)=L(p)U_3(p)=L(p). The source reports computational verification for the relevant primes up to 30413041, but provides no proof or resolution.

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.