Asymptotic conjecture for equal-block mountain-valley assignments

From papers

Let S(m,k)S(m,k) denote the MV assignment with mm blocks, each of size kk, and let c(S(m,k))c(S(m,k)) be its number of foldings. Equal-block asymptotic conjecture. For any fixed mm and sufficiently large kk,

c(S(m,k))em2πmkm.c(S(m,k))\sim \frac{e^m}{\sqrt{2\pi m}} k^m.

The conjecture gives a precise polynomial asymptotic for the equal-block family, based on computational experimentation; no proof or resolution is supplied in the source.

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

Thomas C. Hull, Adham Ibrahim, Jacob Paltrowitz, Natalya Ter-Saakov and Grace Wang, “The Stamp Folding Problem From a Mountain-Valley Perspective”, arXiv:2503.23661 (2025).

Solutions 0

No solutions have been posted yet.