Judicious partitions for restricted self-sumsets in cyclic groups
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911174401982464 |
|---|---|
| author | Irawan, Keane Maverick |
| author_facet | Irawan, Keane Maverick |
| contents | We study the minimax problem for restricted two-fold self-sumsets in $k$-colorings of $\mathbb{Z}_n$. For primes $p$ with $2\le k\le p$ we determine the exact minimum $\max\{0,\,2\lceil p/k\rceil-3\}$. For general $n$ (with $m=\lceil n/k\rceil$) we bound the optimum between a size term $\min\{p(n),\,2m-3\}$ and a periodicity term $f\big(n/q(n,k)\big)$, and show these bounds are tight when $2m-3\le p(n)$ or $f\big(n/q(n,k)\big)\le \min\{p(n),\,2m-3\}$. We further prove a stability inequality and a threshold theorem that force concentration in a single subgroup coset near the periodic scale. In the prime case with $m\ge 5$ and $2m-3<p$, every optimal coloring contains a class of size $m$ that is an arc (an arithmetic progression up to an affine automorphism). Our approach combines the restricted Erdős--Heilbronn phenomenon with block/coset colorings and an injectivity window. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_20568 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Judicious partitions for restricted self-sumsets in cyclic groups Irawan, Keane Maverick Combinatorics Number Theory 11B30, 11B13, 05D05 We study the minimax problem for restricted two-fold self-sumsets in $k$-colorings of $\mathbb{Z}_n$. For primes $p$ with $2\le k\le p$ we determine the exact minimum $\max\{0,\,2\lceil p/k\rceil-3\}$. For general $n$ (with $m=\lceil n/k\rceil$) we bound the optimum between a size term $\min\{p(n),\,2m-3\}$ and a periodicity term $f\big(n/q(n,k)\big)$, and show these bounds are tight when $2m-3\le p(n)$ or $f\big(n/q(n,k)\big)\le \min\{p(n),\,2m-3\}$. We further prove a stability inequality and a threshold theorem that force concentration in a single subgroup coset near the periodic scale. In the prime case with $m\ge 5$ and $2m-3<p$, every optimal coloring contains a class of size $m$ that is an arc (an arithmetic progression up to an affine automorphism). Our approach combines the restricted Erdős--Heilbronn phenomenon with block/coset colorings and an injectivity window. |
| title | Judicious partitions for restricted self-sumsets in cyclic groups |
| topic | Combinatorics Number Theory 11B30, 11B13, 05D05 |
| url | https://arxiv.org/abs/2509.20568 |