Indexed metadata

On additive bases of finite abelian groups

Weidong Gao, Hanbin Zhang

Source record

Source: arXiv

Published: Oct 27, 2026

arXiv: 2610.37136

Open original source ↗

Source abstract

Let GG be a finite abelian group, let pp be the smallest prime divisor of ∣G∣|G|, and let c0(G)c_0(G) be the least integer tt such that every regular sequence over GG of length at least tt is an additive basis. Additive bases have been extensively studied in additive combinatorics, and the exact value of c0(G)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 Cp⊕CpnC_p\oplus C_{pn} turn out to be exceptional). In this paper, we continue the study of c0(G)c_0(G) and obtain the following results. (1) Together with known results, we prove that c0(G)=∣G∣/p+p−2c_0(G)=|G|/p+p-2 for all abelian groups GG with rank(G)≥3\text{rank}(G)\geq 3. (2) For distinct odd primes p<qp<q, we determine c0(Cp⊕Cpq)=pq+2p−3,c0(Cq⊕Cpq)=q2+p−2. c_0(C_p\oplus C_{pq})=pq+2p-3,\qquad c_0(C_q\oplus C_{pq})=q^2+p-2. (3) Let pp be an odd prime, let 2≤a≤b2\leq a\leq b, and let nn be a positive integer with no prime divisor smaller than pp. Then c0(Cpa⊕Cpbn)=pa+b−1n+p−2. c_0(C_{p^a}\oplus C_{p^bn})=p^{a+b-1}n+p-2. (4) For every odd integer n≥3n\geq 3, we prove c0(C3⊕C3n)=3n+3. c_0(C_3\oplus C_{3n})=3n+3. Therefore, c0(G)c_0(G) is determined except possibly for groups of the form Cp⊕CpnC_p\oplus C_{pn} with p≥5p\geq 5.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.