Searcharxiv⌕ Search

arXiv · 2610.37136

On additive bases of finite abelian groups

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\oplus 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 $\text{rank}(G)\geq 3$. (2) For distinct odd primes $p<q$, we determine \[ c_0(C_p\oplus C_{pq})=pq+2p-3,\qquad c_0(C_q\oplus C_{pq})=q^2+p-2. \] (3) Let $p$ be an odd prime, let $2\leq a\leq b$, and let $n$ be a positive integer with no prime divisor smaller than $p$. Then \[ c_0(C_{p^a}\oplus C_{p^bn})=p^{a+b-1}n+p-2. \] (4) For every odd integer $n\geq 3$, we prove \[ c_0(C_3\oplus C_{3n})=3n+3. \] Therefore, $c_0(G)$ is determined except possibly for groups of the form $C_p\oplus C_{pn}$ with $p\geq 5$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Weidong Gao, Hanbin Zhang. 2026-10-27. On additive bases of finite abelian groups. https://arxiv.org/abs/2610.37136

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

A spanning tree model for chromatic homology

After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the chromatic polynomial. In this paper, we present a spanning tree model for the chromatic complex, i.e., we describe a chain complex generated by certain spanning trees of the graph that is chain homotopy equivalent to the chromatic complex. We employ the spanning tree model over $\mathcal{A}_m:= \frac{\mathbb{Z}[x]}{ }$ algebra to answer two open questions. First, we establish the conjecture posed by Sazdanovic and Scofield regarding the homological span of chromatic homology over $\mathcal{A}_m$ algebra, demonstrating that for any graph $G$ with $v$ vertices and $b$ blocks, the homological span is $v - b$. Additionally, we prove a conjecture of Helme-Guizon, Przytycki, and Rong concerning the existence of torsion of order dividing $m$ in chromatic homology over $\mathcal{A}_m$ algebra.

math.CO↗

The double of a simplicial complex

We introduce the notion of doubling and r-tupling for simplicial complexes, a notion reminiscent to that of matching complexes in graph theory. We prove a connectivity result for such complexes and relate r-tupling to stabilizing r times faster in homological stability.

math.CO↗

On the Vertices of Delta-modular Polyhedra

Let $P$ be a polytope defined by the system $A x \leq b$, where $A \in R^{m \times n}$, $b \in R^m$, and $\text{rank}(A) = n$. We give a short geometric proof of the following tight upper bound on the number of vertices of $P$: $$ n! \cdot \fracΔ{Δ_{\text{average}}} \cdot \text{vol}(B_2) \sim \frac{1}{\sqrt{πn}} \cdot \left(\frac{2 π}{e}\right)^{n/2} \cdot n^{n/2} \cdot \fracΔ{Δ_{\text{average}}}, $$ where $Δ$ is the maximum absolute value of $n \times n$ subdeterminants of $A$, and $Δ_{\text{average}}$ is the average absolute value of subdeterminants of $A$ corresponding to a triangulation of $P$'s normal fan. Assuming that $A$ is integer, such polyhedra are called $Δ$-modular polyhedra. Note that in the integer case, the bound can be simplified via the inequality $Δ_{\text{average}} \geq Δ_{\min} \geq 1$, where $Δ_{\min}$ is the minimum absolute value of subdeterminants of $A$ corresponding to feasible bases of $A x \leq b$. For this, we prove and use a symmetric variant of Macbeath's theorem. Additionally, we give a direct argument based on prior results in the field, showing that the graph diameter of $P$ is bounded by $O\bigl(n^3 \cdot \fracΔ{Δ_{\min}} \cdot \ln (n \fracΔ{Δ_{\min}}) \bigr)$. Thus, both characteristic of $P$ are linear in $Δ/Δ_{\min}$. From an algorithmic perspective, we demonstrate that: Given $A \in Q^{m \times n}$, $b \in Q^m$, and an initial feasible solution to $A x \leq b$, the convex hull of $P$ can be constructed in $O(n)^{n/2} \cdot m^2 \cdot \fracΔ{Δ_{\text{average}}}$ operations. For simple polyhedra, the dependence on $m$ reduces to linear; Given $A \in Z^{m \times n}$ and $b \in Q^m$, the number $|P \cap Z^n|$ can be computed in $O(n)^n \cdot \frac{Δ^4}{Δ_{\text{average}}}$ arithmetic operations.

math.CO↗