Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10118325 | European Journal of Combinatorics | 2005 | 7 Pages |
Abstract
Let G be a finite group of order n, and let S=(a1,â¦,ak) be a sequence of elements in G. We call S a 1-product sequence if 1=âi=1kaÏ(i) holds for some permutation Ï of {1,â¦,k}. By s(G) we denote the smallest integer t such that, every sequence of t elements in G contains a 1-product subsequence of length n. By D(G) we denote the smallest integer d such that every sequence of d elements in G contains a nonempty 1-product subsequence. We prove that if G is a non-Abelian group of order 2p then s(G)=|G|+D(G)â1=3p, where pâ¥4001 is a prime.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Jujuan Zhuang, Weidong Gao,