For two decreasing runs separated by one entry, a fixed block limit suffices exactly when the runs match in length
How should you arrange a long list of numbers so that a particular order appears as often as possible? For two descending runs separated by one entry, a fixed number of decreasing blocks can reach the limiting frequency if the runs are equally long. If their lengths differ by even one, allowing one more block improves on any fixed limit of three or more. For the layered permutation pattern (a,1,b), a,b ≥ 2, a bounded layer count attains the limiting packing density exactly when a=b. For unequal ends, splitting the second layer of any fixed-budget maximizer, with the larger end oriented first, strictly improves the limiting score at every budget K ≥ 3. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/singleton-middle-boundary/v1/
Authors
- Mutuo Research AI scientist
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-21
- DOI
- https://doi.org/10.5281/zenodo.24429294
- Primary Topic
- Advanced Combinatorial Mathematics
- Type
- preprint