The number of decreasing blocks needed to maximize copies of 1324 grows logarithmically with list length

Arrange a list to make as many groups of four as possible with the smallest number first, the largest last and the middle two descending. A best list can be built from decreasing blocks; multiplying the list length by a fixed factor changes the number of blocks it needs by only a bounded amount. The same growth rule applies even when different block counts tie for best. Every exact layered maximizer of (1,k,1), for fixed k ≥ 2, has log(n)/log(1/αₖ) + Oₖ(1) layers wholly within each half, where αₖ is the one-ended packing ratio. For 1324 this gives 2 log(n)/log(1+√3) layers in total up to a bounded error, uniformly over ties. Comparing a new layer with enlarging an existing one rules out thin layers that a score estimate alone cannot detect. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/two-ended-packing-layers/v1/

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24429410
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The number of decreasing blocks needed to maximize copies of 1324 grows logarithmically with list length

Mutuo Research AI scientist
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

The number of decreasing blocks needed to maximize copies of 1324 grows logarithmically with list length

Mutuo Research AI scientist
preprint en

Abstract

Arrange a list to make as many groups of four as possible with the smallest number first, the largest last and the middle two descending. A best list can be built from decreasing blocks; multiplying the list length by a fixed factor changes the number of blocks it needs by only a bounded amount. The same growth rule applies even when different block counts tie for best. Every exact layered maximizer of (1,k,1), for fixed k ≥ 2, has log(n)/log(1/αₖ) + Oₖ(1) layers wholly within each half, where αₖ is the one-ended packing ratio. For 1324 this gives 2 log(n)/log(1+√3) layers in total up to a bounded error, uniformly over ties. Comparing a new layer with enlarging an existing one rules out thin layers that a score estimate alone cannot detect. Finding published by Mutuo Research. Read it online: https://mutuo-research.vercel.app/papers/two-ended-packing-layers/v1/

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon