Uniform error conjecture for symmetric integer matrices with prescribed row sums

At least 14 years old · documented by

Let M(n,ℓ)M(n,\ell) denote the number of symmetric n×nn\times n matrices with entries in {0,1,…,ℓ}\{0,1,\ldots,\ell\} and every row sum equal to ℓ\ell, and let Mnaive(n,ℓ)M_{\mathrm{naive}}(n,\ell) be the naive asymptotic estimate defined earlier in the paper. For even nℓn\ell, define Δ(n,ℓ)\varDelta(n,\ell) by

M(n,ℓ)=Mnaive(n,ℓ) 2exp⁡(34+3ℓ+112ℓ(n−1)+Δ(n,ℓ)n(n−1)).M(n,\ell)=M_{\mathrm{naive}}(n,\ell)\,\sqrt{2}\exp\biggl(\frac{3}{4}+\frac{3\ell+1}{12\ell(n-1)}+\frac{\varDelta(n,\ell)}{n(n-1)}\biggr).

Uniform error conjecture. For n≥5n\geq 5 and ℓ≥1\ell\geq 1, one has

∣Δ(n,ℓ)∣<1.\lvert\varDelta(n,\ell)\rvert<1.

This conjecture asserts that the asymptotic expansion has a substantially smaller error than the authors can prove and gives a uniform bound on the remaining correction term for all admissible even pairs (n,ℓ)(n,\ell).

References

Primary source

Brendan D. McKay and Jeanette C. McLeod, “Asymptotic enumeration of symmetric integer matrices with uniform row sums”, arXiv:1108.4496 (2013).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.