PreprintCC BY 4.0arXiv
Small-LCM Distinct Covering Systems via Segmented Local Search
Abstract
We construct distinct covering systems with minimum moduli 8, 9, 10, 11 and least common multiples 20160, 75600, 302400, 3326400, respectively, and conjecture that these values are minimal. For minimum modulus 8, the exclusion computations leave only 10080 and 15120 unresolved below our construction. The constructions use segmented local search: moduli are introduced in increasing blocks, followed by joint reoptimization of selected blocks. We give complete residue lists and an independent integer-arithmetic verifier. Two computational studies, comprising 180 initial runs and 130 follow-up runs, compare initialization orders, revisit rules and seed-bank capacities under fixed scan limits.
Related
- Results for distinct covering systems with a prime minimum modulus q ≥ 11
- Global smooth behavior in Kuznetsov and Westervelt type viscous wave equations: A unifying approach covering W1,q-small initial data
- On covering systems over finite nilpotent groups and lattices
- Weighted density bounds for covering systems over Dedekind domains
- FluxDisco: Symbolic Regression for Stoichiometric Dynamical Systems via Monte Carlo Graph Search
BibTeX
@misc{zhang2026smalllcm,
title = {{Small-LCM Distinct Covering Systems via Segmented Local Search}},
author = {Jiheng Zhang},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.01282},
eprint = {2611.01282},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.01282},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Small-LCM Distinct Covering Systems via Segmented Local Search
AU - Jiheng Zhang
PY - 2026
DA - 2026/11/01
PB - arXiv
DO - 10.48550/arxiv.2611.01282
UR - https://arxiv.org/abs/2611.01282
AB - We construct distinct covering systems with minimum moduli 8, 9, 10, 11 and least common multiples 20160, 75600, 302400, 3326400, respectively, and conjecture that these values are minimal. For minimum modulus 8, the exclusion computations leave only 10080 and 15120 unresolved below our construction. The constructions use segmented local search: moduli are introduced in increasing blocks, followed by joint reoptimization of selected blocks. We give complete residue lists and an independent integer-arithmetic verifier. Two computational studies, comprising 180 initial runs and 130 follow-up runs, compare initialization orders, revisit rules and seed-bank capacities under fixed scan limits.
ER -