On additive bases of finite abelian groups
math.CO
Submitted: 2026-10-27
Updated: 2026-10-27
Comments: 21 pages
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Let G be a finite abelian group, let p be the smallest prime divisor of G, and let c 0(G) be the least integer t such that every regular sequence over G of length at least t is an additive basis.
Abstract
Let G be a finite abelian group, let p be the smallest prime divisor of G, and let c 0(G) be the least integer t such that every regular sequence over G of length at least t is an additive basis. Additive bases have been extensively studied in additive combinatorics, and the exact value of c 0(G) has been determined for many groups of rank at least three and some groups of rank two (in which case groups of the form C p plus C pn turn out to be exceptional). In this paper, we continue the study of c 0(G) and obtain the following results. (1) Together with known results, we prove that c 0(G)=G/p+p-2 for all abelian groups G with rank(G) at least 3. (2) For distinct odd primes p<q, we determine c 0(C p plus C pq)=pq+2p-3, c 0(C q plus C pq)=q 2+p-2. (3) Let p be an odd prime, let 2 at most a at most b, and let n be a positive integer with no prime divisor smaller than p. Then c 0(C p a plus C p bn)=p a+b-1n+p-2. (4) For every odd integer n at least 3, we prove c 0(C 3 plus C 3n)=3n+3. Therefore, c 0(G) is determined except possibly for groups of the form C p plus C pn with p at least 5.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality