Papers
Topics
Authors
Recent
Search
2000 character limit reached

Additive bases and the zero-sum invariant N(G)\mathsf{N}(G) for groups Cp⊕CnpC_p\oplus C_{np}

Published 9 Oct 2026 in math.CO | (2610.13103v1)

Abstract: Let GG be a finite abelian group, and let c0(G)c_0(G) be the least integer such that every regular sequence over GG of at least this length is an additive basis. Let N(G)\mathsf N(G) be the least integer ll such that every weak-regular sequence SS over GG with ∣S∣≥l|S|\ge l has a nonempty zero-sum subsequence TT satisfying vg(T)=vg(S)\mathsf v_g(T)=\mathsf v_g(S) for some g∣Sg\mid S. We obtain a common upper bound for c0(Cq⊕Cnq)c_0(C_q\oplus C_{nq}) for groups of odd order, where qq is prime, and prove N(G)≥r(nr−1)+1\mathsf N(G)\ge r(n_r-1)+1 when G=Cn1⊕⋯⊕CnrG=C_{n_1}\oplus\cdots\oplus C_{n_r} with $1&lt;n_1\mid\cdots\mid n_r$. If n≥1n\ge1 and p≥3p\ge3 is the smallest prime divisor of npnp, we obtain N(Cp⊕Cnp<sup>2)=2np<sup>2−1\mathsf N(C_p\oplus C_{np<sup>2})=2np<sup>2-1 and give upper bounds for N(Cp⊕Cnp)\mathsf N(C_p\oplus C_{np}) when p∤np\nmid n. We also determine N(Cn)\mathsf N(C_n) for two infinite families of cyclic groups arising in earlier work.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.