Asymptotic formula for flip-graph vertices of repeated even chains

From papers

Let \ell be a fixed even positive integer, and let G(,,n copies)G(\underbrace{\ell,\dots,\ell}_{n\text{ copies}}) denote the flip graph associated with the product of nn chains of length \ell. Asymptotic vertex-count conjecture. As nn tends to infinity,

logv(G(,,n copies))C(2)nn,\log v(G(\underbrace{\ell,\dots,\ell}_{n\text{ copies}})) \sim C\frac{(2\ell)^n}{\sqrt{n}},

where

C=log22π(21)(2+1)/3.C=\frac{\log 2}{\sqrt{2\pi(2\ell-1)(2\ell+1)/3}}.

The paper gives exact asymptotics in dimensions two and three and notes that the exact logarithmic asymptotic is open for dimensions at least four; this formula is proposed for the repeated-chain family.

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

Serena An and Holden Mui, “Flip Graphs on Self-Complementary Ideals of Chain Products”, arXiv:2401.01457 (2024).

Solutions 0

No solutions have been posted yet.