Extremal product-one free sequences in Dihedral and Dicyclic Groups

@article{Martnez2018ExtremalPF,
  title={Extremal product-one free sequences in Dihedral and Dicyclic Groups},
  author={Fabio Enrique Brochero Mart{\'i}nez and S{\'a}vio Ribas},
  journal={Discret. Math.},
  year={2018},
  volume={341},
  pages={570-578}
}
Extremal product-one free sequences over $C_n \rtimes_s C_2$
Let G be a finite group multiplicatively written. The small Davenport constant of G is the maximum positive integer d(G) such that there exists a sequence S of length d(G) for which every subsequence
On Erdős-Ginzburg-ZIV inverse theorems for dihedral and dicyclic groups
Let G be a finite group and exp( G ) = lcm{ord( g ) ∣ g ∈ G }. A finite unordered sequence of terms from G , where repetition is allowed, is a product-one sequence if its terms can be ordered such
A pr 2 01 9 ON MINIMAL PRODUCT-ONE SEQUENCES OF MAXIMAL LENGTH OVER DIHEDRAL AND DICYCLIC GROUPS
TLDR
This work provides explicit characterizations of all minimal product- one sequences of length D(G) over Dihedral and Dicyclic groups and studies the unions of sets of lengths of the monoid of product-one sequences over these groups.
On minimal product-one sequences of maximal length over Dihedral and Dicyclic groups
TLDR
This work provides explicit characterizations of all minimal product- one sequences of length $\mathsf D (G)$ over Dihedral and Dicyclic groups and studies the unions of sets of lengths of the monoid of product-one sequences over these groups.
ON PRODUCT-ONE SEQUENCES OVER DIHEDRAL GROUPS ALFRED GEROLDINGER AND DAVID J. GRYNKIEWICZ AND JUN SEOK OH AND QINGHAI ZHONG
Let G be a finite group. A sequence over G means a finite sequence of terms from G, where repetition is allowed and the order is disregarded. A product-one sequence is a sequence whose elements can
Harborth constants for certain classes of metacyclic groups
On product-one sequences over dihedral groups
Let [Formula: see text] be a finite group. A sequence over [Formula: see text] means a finite sequence of terms from [Formula: see text], where repetition is allowed and the order is disregarded. A
...
...

References

SHOWING 1-10 OF 22 REFERENCES
Erdos-Ginzburg-Ziv theorem for dihedral groups of large prime index
Inverse zero-sum problems III
Let G be a nite abelian group. The Davenport constant D(G) is the smallest integer ` 2 N such that every sequence S over G of length jSj ` has a nontrivial zero-sum subsequence. Let G = Cn Cn with n
A Combinatorial Problem on Finite Abelian Groups
Abstract In this paper the following theorem is proved. Let G be a finite Abelian group of order n . Then, n + D ( G )−1 is the least integer m with the property that for any sequence of m elements a
Inverse zero-sum problems
Let G be an additive finite abelian group with exponent exp(G) = n. We define some central invariants in zero-sum theory: Let • D(G) denote the smallest integer l ∈ N such that every sequence S over
Inverse zero-sum problems II
Let $G$ be an additive finite abelian group. A sequence over $G$ is called a minimal zero-sum sequence if the sum of its terms is zero and no proper subsequence has this property. Davenport's
The Inverse Problem Associated to the Davenport Constant for C2+C2+C2n, and Applications to the Arithmetical Characterization of Class Groups
TLDR
A characterization, via the system of sets of lengths, of the class group of rings of algebraic integers is obtained for certain types of groups, and the Davenport constants of groups of the form C 4 ⊕ C4n and C 6 ⊵ C6n are determined.
ON ZERO-SUM SEQUENCES IN Z/nZ⊕ Z/nZ
It is well known that the maximal possible length of a minimal zero-sum sequence S in the group Z/nZ⊕Z/nZ equals 2n−1, and we investigate the structure of such sequences. We say that some integer n ≥
Conditions for a Zero Sum Modulo n
In this paper the following result is proved. Let n > 0 and k ≥ 0 be integers with n — 2k ≥ 1. Given any n — k integers there is a non-empty subset of indices I ⊂ {1, 2,…, n — k} such that the sum
Theorem in the Additive Number Theory
THEOREM. Each set of 2n-1 integers contains some subset of n elements the sum of which is a multiple of n. PROOF. Assume first n = p (p prime). Our theorem is trivial for p = 2, thus henceforth p >
...
...