Regresar

On subsequence weighted products

Abstract:

Let G be a finite group of order n and let k be a natural number. Let {xi : 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 {σi : 1 ≤ i ≤ k} be a family of permutations of G such that σ1(1) = 1 for all i. We obtain the following result. There are pairwise distinct elements i1, i2, ..., ik such that ∏ σj(v-1 xij) = 1. © 2005 Cambridge University Press.