ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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 n→∞n\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.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.