Conjecture on monotonicity of successive average stack-sorting depths

Less than 1 year old · traced to

Let Dn′\mathcal{D}_n' denote the auxiliary average stack-sorting depth sequence defined in the paper. Consider its successive differences

Dn′−Dn−1′,n≥2.\mathcal{D}_{n}'-\mathcal{D}'_{n-1},\qquad n\geq 2.

Monotonicity conjecture. The sequence

(Dn′−Dn−1′)n=2∞\left(\mathcal{D}_{n}'-\mathcal{D}'_{n-1}\right)_{n=2}^{\infty}

is monotonically increasing.

This conjecture is motivated by numerical evidence and is presented as a future direction; no proof or resolution is supplied in the given text.

References

Primary source

Jerry Zhang, “Asymptotics of the Average Stack-Sorting Depth”, arXiv:2606.24110 (2026).

Progress summary

Never refreshed

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

Solutions 0

No solutions have been posted yet.