On subsequence weighted products

Abstract:

Let G be a finite group of order n and let k be a natural number. Let {x<inf>i</inf> : i ε} be a family of elements of G such that |I| = n + k - 1. Let v be the most repeated value of the family. Let {σ<inf>i</inf> : 1 ≤ i ≤ k} be a family of permutations of G such that σ<inf>1</inf>(1) = 1 for all i. We obtain the following result. There are pairwise distinct elements i<inf>1</inf>, i<inf>2</inf>, ..., i<inf>k</inf> such that ∏ σ<inf>j</inf>(v^-1 x<inf>ij</inf>) = 1. © 2005 Cambridge University Press.

Año de publicación:

2005

Keywords:

Fuente:

scopus

google