2020/03/31 by Zhao, Kevin
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2003.14007
Let G be a finite group and D2n be the dihedral group of 2n elements. For a positive integer d, let sdℕ(G) denote the smallest integer ℓ∈ ℕ0∪ \+∞\ such that every sequence S over G of length |S|≥ ℓ has a nonempty 1-product subsequence T with |T|≡ 0 (mod d). In this paper, we mainly study the problem for dihedral groups D2n and determine their exact values: sdℕ(D2n)=2d+\lfloor log2n\rfloor, if d is odd with n|d; sdℕ(D2n)=nd+1, if gcd(n,d)=1. Furthermore, we also analysis the problem for metacyclic groups Cp\ltimess Cq and obtain a result: skpℕ(Cp\ltimess Cq)=lcm(kp,q)+p-2+gcd(kp,q), where p≥ 3 and p|q-1.