Metraipolis › archive › dc_04d8359df400
Critical Restricted Sumsets at the Boundary $\lvert A\rvert+\lvert B\rvert=p$ — arXiv:2609.14544
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14544
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T01:25:46.833Z
- SHA-256 of the archived text
d1ae4302abd0ece28262e0ccdefa7dba1cc137b0ac972059125877d6a2aacbdb- Stable URL of this page
https://metraipolis.com/documento/dc_04d8359df400
How to cite
Critical Restricted Sumsets at the Boundary $\lvert A\rvert+\lvert B\rvert=p$ — arXiv:2609.14544 — arXiv (en), https://arxiv.org/abs/2609.14544 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_04d8359df400 (Metraipolis archive dc_04d8359df400, sha256 d1ae4302abd0ece28262e0ccdefa7dba1cc137b0ac972059125877d6a2aacbdb)
BibTeX
@misc{dc04d8359df400,
title = {Critical Restricted Sumsets at the Boundary $lvert Arvert+lvert Brvert=p$ — arXiv:2609.14544},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14544},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_04d8359df400; sha256 d1ae4302abd0ece28262e0ccdefa7dba1cc137b0ac972059125877d6a2aacbdb},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14544. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $p$ be an odd prime, and write $A\RS B=\{a+b:a\in A,\ b\in B,\ a\ne b\}$. We classify all pairs $A,B\subseteq\Fp$ satisfying $|A|+|B|=p$, $|A|>|B|=\ell\ge1$, and $|A\RS B|=p-2$. After normalizing the two missing sums to $\{0,1\}$, we obtain exactly $\ell+1$ explicit models. The classification forces $B\subseteq A$ and yields, for fixed $p,\ell$, exactly $\binom p2(\ell+1)$ ordered pairs and $1+\lfloor\ell/2\rfloor$ equivalence classes under simultaneous affine transformations. We determine when either set is an arithmetic progression and compute exact difference-set cardinalities. For $\ell\ge3$ and $p\ge4\ell-5$, the cardinality $|B-B|$ determines the equivalence class at fixed $p,\ell$. The proof uses punctured translates and cyclic component counting. We also exhibit a critical pair in $\mathbb F_{13}$, with size gap three and $|A|+|B|=p-2$, that contradicts a proposed inverse statement below the boundary.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.CO).
Categorie arXiv: Number Theory (math.NT) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.14544 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T00:39:30.290Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).