Restricted inverse zero-sum problems in groups of rank 2. (Q2890810)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Restricted inverse zero-sum problems in groups of rank 2. |
scientific article; zbMATH DE number 6045454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Restricted inverse zero-sum problems in groups of rank 2. |
scientific article; zbMATH DE number 6045454 |
Statements
12 June 2012
0 references
combinatorial constants for finite Abelian groups
0 references
Abelian groups of rank two
0 references
zero-sum sequences
0 references
inverse zero-sum problems
0 references
Restricted inverse zero-sum problems in groups of rank 2. (English)
0 references
Let \(G\) be a finite Abelian group of exponent \(N\), and denote by \(s(G)\) the smallest integer \(k\) such that each sequence of \(\geq k\) elements of \(G\) has a subsequence of length equal to \(N\) with vanishing sum. Replacing here equality by \(\leq N\) one obtains another constant, denoted by \(\eta(G)\). The author considers groups of rank \(2\). He presents a construction of sequences of lengths \(s(G)-1\) and \(\eta(G)-1\), respectively, which do not have such subsequences, and shows that in certain cases his construction gives all such sequences. This applies in particular to groups of the form \(C_m\oplus C_m\) in the first case, and to groups of that form with \(m=2^a3^b5^c7^d\) in the second case.
0 references