A lower bound and the cases n = 8, 9 of Fonollosa's minimum-modulus conjecture

A set A of n residues modulo N is valid if the all-ones multiset is the only multiset of size n drawn from A whose sum is the sum of the elements of A modulo N. Fonollosa conjectured that the least N for which a valid n-set exists is f(n) = 2^n − 2^⌊log₂ n⌋, proved that f(n) is attained, and certified the conjecture for n ≤ 7 with a constraint solver. By a result of Inal, a valid n-set forces N ≥ 2^(n−1), and this bound is sharp among all finite abelian groups. We prove that cyclic groups do better: for n ≥ 5, every valid n-set modulo N satisfies N ≥ 2^(n−1) + max(2n − 2, ⌈(2^(n−1) − 1)/(n − 1)⌉). We also verify the conjecture for n = 8 and n = 9 by two exhaustive searches, so the least moduli are 248 and 504. Both searches rest on the same exact insertion test and the same normal form, and we state this limit explicitly. The data archive contains the two search programs, the validation drivers, every run log cited in the paper, the reruns of 14 November 2026, the lab reports and the LaTeX source.

Authors

Publication Details

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

A lower bound and the cases n = 8, 9 of Fonollosa's minimum-modulus conjecture

Theo Nicolas Sitjar
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

A lower bound and the cases n = 8, 9 of Fonollosa's minimum-modulus conjecture

Theo Nicolas Sitjar
preprint en

Abstract

A set A of n residues modulo N is valid if the all-ones multiset is the only multiset of size n drawn from A whose sum is the sum of the elements of A modulo N. Fonollosa conjectured that the least N for which a valid n-set exists is f(n) = 2^n − 2^⌊log₂ n⌋, proved that f(n) is attained, and certified the conjecture for n ≤ 7 with a constraint solver. By a result of Inal, a valid n-set forces N ≥ 2^(n−1), and this bound is sharp among all finite abelian groups. We prove that cyclic groups do better: for n ≥ 5, every valid n-set modulo N satisfies N ≥ 2^(n−1) + max(2n − 2, ⌈(2^(n−1) − 1)/(n − 1)⌉). We also verify the conjecture for n = 8 and n = 9 by two exhaustive searches, so the least moduli are 248 and 504. Both searches rest on the same exact insertion test and the same normal form, and we state this limit explicitly. The data archive contains the two search programs, the validation drivers, every run log cited in the paper, the reruns of 14 November 2026, the lab reports and the LaTeX source.

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