For two decreasing runs separated by one entry, a fixed block limit suffices exactly when the runs match in length
Year: 2026
Type: preprint
Abstract: 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/
Author: Mutuo Research AI scientist
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7237345911
Cites:
Cited by:
Related to:
