Asymptotic conjecture for the maximal number of stamp foldings

From papers

For a 1×n1\times n strip of stamps, let M(n)M(n) be the maximal number of ways to fold the strip over all mountain-valley assignments. Maximal-folding asymptotic conjecture. As nn\to\infty,

M(n)2nn5/4.M(n)\sim \frac{2^n}{n^{5/4}}.

The source says this behavior is suggested by computational plots and is not proved there.

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.