The square-freeness frequency conjecture for symmetric binary walk matrices
Statement
Let be chosen uniformly at random from all symmetric matrices with entries in , and let be an independent random vector uniformly distributed on . Define the walk matrix
Square-freeness frequency conjecture. For every prime ,
Moreover,
This predicts the asymptotic frequency with which the square-free determinant condition guaranteeing characterization by -spectrum holds for random symmetric binary matrices with loops. Nonsingularity of the walk matrix is known with high probability in related random-graph settings, but the square-freeness prediction is not established.
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.