On the sequence with fewer subsequence sums in finite abelian groups. (English) Zbl 07906416
Let \(G\) be a finite abelian group and let \(S\) be a sequence with elements from \(G\). The length of the sequence, denoted by \(|S|\), refers to the total number of elements in \(S\), including repetitions. For each sequence \(S\), let \(\Sigma(S) \subset G\) denote the set of group elements that can be represented as the sum of one or more elements from a nonempty subsequence of \(S\). This set, \(\Sigma(S)\), contains all possible sums that can be formed from the elements of \(S\) without considering the empty subsequence. It is a known result that if \(0 \notin \Sigma(S)\), then the cardinality of \(\Sigma(S)\), denoted \(|\Sigma(S)|\), satisfies \(|\Sigma(S)| \geq |S|\). This inequality illustrates that the set of sums, when zero is excluded, must have a size at least as large as the length of the original sequence. Better lower bounds for this quantity have been deeply studied by several authors.
In this work, the authors focus on sequences \(S\) for which the union \(\Sigma(S) \cup \{0\}\) satisfies \(|\Sigma(S) \cup \{0\}| \leq |S|\). This condition imposes significant constraints on the structure of the sequence and its corresponding sumset. Their results primarily investigate the special case where \(|\Sigma(S) \cup \{0\}|\) is a prime number \(p\).
More particularly, the authors show that if this condition is met – meaning that the size of the sumset, including zero, is a prime number – then the sequence \(S\) must generate a cyclic subgroup of \(G\) of order \(p\). Their results indicate that the structure of the group generated by \(S\) is highly restricted under these conditions, and \(S\) necessarily forms a cyclic group with exactly \(p\) elements. This finding reveals a deep interaction between the combinatorial properties of sequences and the algebraic structure of the group to which they belong.
The authors are also able to study the problem in the case that this cardinal is equal to \(q=6,8,9\) (Theorem 1.2). On each case, the authors are able to provide an explicit characterization (up to group isomorphism) of the group generated by \(S\).
In this work, the authors focus on sequences \(S\) for which the union \(\Sigma(S) \cup \{0\}\) satisfies \(|\Sigma(S) \cup \{0\}| \leq |S|\). This condition imposes significant constraints on the structure of the sequence and its corresponding sumset. Their results primarily investigate the special case where \(|\Sigma(S) \cup \{0\}|\) is a prime number \(p\).
More particularly, the authors show that if this condition is met – meaning that the size of the sumset, including zero, is a prime number – then the sequence \(S\) must generate a cyclic subgroup of \(G\) of order \(p\). Their results indicate that the structure of the group generated by \(S\) is highly restricted under these conditions, and \(S\) necessarily forms a cyclic group with exactly \(p\) elements. This finding reveals a deep interaction between the combinatorial properties of sequences and the algebraic structure of the group to which they belong.
The authors are also able to study the problem in the case that this cardinal is equal to \(q=6,8,9\) (Theorem 1.2). On each case, the authors are able to provide an explicit characterization (up to group isomorphism) of the group generated by \(S\).
Reviewer: Juanjo Rué Perna (Barcelona)
MSC:
| 11P70 | Inverse problems of additive number theory, including sumsets |
| 11B50 | Sequences (mod \(m\)) |
| 11B13 | Additive bases, including sumsets |
References:
| [1] | Bollobás, B.; Leader, I., The number of \(k\)-sums modulo \(k\), J. Number Theory, 78, 27-35, 1999 · Zbl 0929.11008 · doi:10.1006/jnth.1999.2405 |
| [2] | Bovey, JD; Erdős, P.; Niven, I., Conditions for zero sum modulo \(n\), Can. Math. Bull., 18, 27-29, 1975 · Zbl 0314.10040 · doi:10.4153/CMB-1975-004-4 |
| [3] | Eggleton, RB; Erdős, P., Two combinatorial problems in group theory, Acta Arith., 21, 111-116, 1972 · Zbl 0248.20068 · doi:10.4064/aa-21-1-111-116 |
| [4] | Gao, W.; Li, Y.; Peng, J.; Sun, F., On subsequence sums of a zero-sum free sequence II, Electron. J. Combin., 15, R117, 2008 · Zbl 1207.11025 · doi:10.37236/841 |
| [5] | Gao, W.; Huang, M.; Hui, W.; Li, Y.; Liu, C.; Peng, J., Sums of sets of abelian group elements, J. Number Theory, 208, 208-229, 2020 · Zbl 1464.11031 · doi:10.1016/j.jnt.2019.07.026 |
| [6] | Geroldinger, A.; Halter-Koch, F., Non-Unique Factorizations: Algebraic, Combinatorial and Analytic Theory, 2006, Boca Raton: Chapman & Hall/CRC, Boca Raton · Zbl 1113.11002 |
| [7] | Olson, JE; White, ET; Zassenhaus, H., Sums from a sequence of group elements, Number Theory and Algebra, 215-222, 1977, Boca Raton: Academic Press, Boca Raton · Zbl 0368.05009 |
| [8] | Peng, J.; Li, Y.; Liu, C.; Huang, M., On subsequence sums of a zero-sum free sequence over finite abelian groups, J. Number Theory, 217, 193-217, 2020 · Zbl 1469.11039 · doi:10.1016/j.jnt.2020.04.024 |
| [9] | Yuan, P., Subsequence sums of a zero-sum free sequence, Eur. J. Combin., 30, 439-446, 2009 · Zbl 1170.20033 · doi:10.1016/j.ejc.2008.04.008 |
| [10] | Zeng, X.; Yuan, P., On sequences without short zero-sum subsequences, Electron. J. Combin., 30, P4-21, 2023 · Zbl 1536.11050 · doi:10.37236/11963 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
