Uniform error conjecture for symmetric integer matrices with prescribed row sums

From papers

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 nn\ell, define Δ(n,)\varDelta(n,\ell) by

M(n,)=Mnaive(n,)2exp(34+3+112(n1)+Δ(n,)n(n1)).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 n5n\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).

Progress summary

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

Sources & referencesView supporting material

Primary source

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

Solutions 0

No solutions have been posted yet.