ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let \bM\bM be chosen uniformly at random from all symmetric n×nn\times n matrices with entries in {0,1}\{0,1\}, and let ζ\zeta be an independent random vector uniformly distributed on {0,1}n\{0,1\}^n. Define the walk matrix

\bW=[ζ,\bMζ,…,\bMn−1ζ].\bW=[\zeta,\bM\zeta,\ldots,\bM^{n-1}\zeta].

Square-freeness frequency conjecture. For every prime pp,

lim⁡n→∞P(p2∤det⁡(\bW))=(1−1p2−1p3+1p4)∏k=1∞(1−1p2k).\lim_{n\to\infty}\mathbb P\bigl(p^2\nmid\det(\bW)\bigr)=\left(1-\frac{1}{p^2}-\frac{1}{p^3}+\frac{1}{p^4}\right)\prod_{k=1}^{\infty}\left(1-\frac{1}{p^{2k}}\right).

Moreover,

lim⁡n→∞P(det⁡(\bW) is square-free)=∏p prime(1−1p2−1p3+1p4)∏k=1∞(1−1p2k)=0.2943….\lim_{n\to\infty}\mathbb P\bigl(\det(\bW)\text{ is square-free}\bigr)=\prod_{p\text{ prime}}\left(1-\frac{1}{p^2}-\frac{1}{p^3}+\frac{1}{p^4}\right)\prod_{k=1}^{\infty}\left(1-\frac{1}{p^{2k}}\right)=0.2943\ldots.

This predicts the asymptotic frequency with which the square-free determinant condition guaranteeing characterization by Φ\Phi-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 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.