Additively stable sets, critical sets for the 3k-4 theorem in $\mathbb{Z}$ and $\mathbb{R}$
Number Theory
2025-01-13 v2 Combinatorics
Abstract
We describe in this paper additively left stable sets, i.e. sets satisfying (meaning that is stable by addition with itself on its convex hull), when is a finite subset of integers and when is a bounded subset of real numbers. More precisely we give a sharp upper bound for the density of in for , and construct sets reaching this density for any given in this range. This gives some information on sets involved in the structural description of some critical sets in Freiman's theorem in both cases.
Keywords
Cite
@article{arxiv.2311.13891,
title = {Additively stable sets, critical sets for the 3k-4 theorem in $\mathbb{Z}$ and $\mathbb{R}$},
author = {Paul Péringuey and Anne de Roton},
journal= {arXiv preprint arXiv:2311.13891},
year = {2025}
}
Comments
18 pages, 5 figures