Papers
Topics
Authors
Recent
2000 character limit reached

additive bases of abelian groups of rank 2 (2112.02564v1)

Published 5 Dec 2021 in math.CO

Abstract: Let $G$ be a finite abelian group and $p$ be the smallest prime dividing $|G|$. Let $S$ be a sequence over $G$. We say that $S$ is regular if for every proper subgroup $H \subsetneq G$, $S$ contains at most $|H|-1$ terms from $H$. Let $\mathsf c_0(G)$ be the smallest integer $t$ such that every regular sequence $S$ over $G$ of length $|S|\geq t$ forms an additive basis of $G$, i.e., $\sum(S)=G$. The invariant $\mathsf c_0(G)$ was first studied by Olson and Peng in 1980's, and since then it has been determined for all finite abelian groups except for the groups with rank 2 and a few groups of rank 3 or 4 with order less than $108$. In this paper, we focus on the remaining case concerning groups of rank 2. It was conjectured by Gao et al. (Acta Arith. 168 (2015) 247-267) that $\mathsf c_0(G)=m(G)$. We confirm the conjecture for the case when $G=C_{n_1}\oplus C_{n_2}$ with $n_1|n_2$, $n_1\geq 2p$, $p\geq 3$ and $n_1n_2\geq 72p6$.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.