The cyclicity probability conjecture for Jacobians of random graphs
Statement
Let be the Erdős–Rényi random graph on vertices, with each edge included independently with fixed probability . The cyclicity probability conjecture. The probability that its Jacobian is cyclic satisfies
as , where is the Riemann zeta function. This prediction follows by combining the conjectural Sylow- 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.