Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.18577 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917423269019648 |
|---|---|
| author | Biswas, Arindam |
| author_facet | Biswas, Arindam |
| contents | We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes simultaneous additive growth across several color classes. We show some general lifting and invariance principles, establish chromatic covering theorems for finite tuples and for tuples whose color classes are finite unions of unbounded linear sets, and obtain exact structure theorems for translated submonoids and finite-set-plus-submonoid sets. We also obtain sharper binomial bounds in the finite and unbounded-linear cases than the previous lattice-covering estimates. In the integer setting, we show that for each fixed threshold $t$, the threshold-$t$ chromatic layers form an asymptotic approximate family, using Nathanson's eventual interval-plus-edges description to obtain a uniform bound of size $r+2$ and prove an inhomogeneous extension for certain families. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_18577 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On Chromatic Asymptotic Approximate Groups Biswas, Arindam Combinatorics 11B13, 11B34, 20F69, 11P70 We study a chromatic theory of asymptotic approximate groups for tuples of subsets of abelian groups, combining Nathanson's chromatic sumset formalism with asymptotic covering ideas from approximate group theory. This framework encodes simultaneous additive growth across several color classes. We show some general lifting and invariance principles, establish chromatic covering theorems for finite tuples and for tuples whose color classes are finite unions of unbounded linear sets, and obtain exact structure theorems for translated submonoids and finite-set-plus-submonoid sets. We also obtain sharper binomial bounds in the finite and unbounded-linear cases than the previous lattice-covering estimates. In the integer setting, we show that for each fixed threshold $t$, the threshold-$t$ chromatic layers form an asymptotic approximate family, using Nathanson's eventual interval-plus-edges description to obtain a uniform bound of size $r+2$ and prove an inhomogeneous extension for certain families. |
| title | On Chromatic Asymptotic Approximate Groups |
| topic | Combinatorics 11B13, 11B34, 20F69, 11P70 |
| url | https://arxiv.org/abs/2604.18577 |