ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G(n,q)G(n,q) be the Erdős–Rényi random graph on nn vertices, with each edge included independently with fixed probability 0<q<10<q<1. The cyclicity probability conjecture. The probability that its Jacobian is cyclic satisfies

P(Jac⁡(G(n,q)) is cyclic)⟶∏p∏i=1∞(1−p−1−2i)=ζ(3)−1ζ(5)−1ζ(7)−1ζ(9)−1⋯\mathbb P\bigl({\operatorname{Jac}}(G(n,q))\text{ is cyclic}\bigr)\longrightarrow\prod_p\prod_{i=1}^{\infty}(1-p^{-1-2i})=\zeta(3)^{-1}\zeta(5)^{-1}\zeta(7)^{-1}\zeta(9)^{-1}\cdots

as n→∞n\to\infty, where ζ(s)\zeta(s) is the Riemann zeta function. This prediction follows by combining the conjectural Sylow-pp cyclicity probabilities. The paper presents it as a consequence of the main heuristic and reports empirical support; no resolution is supplied in the source.

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.