Hostname: page-component-74656f9884-kv2lp Total loading time: 0 Render date: 2026-11-06T02:51:17.284Z Has data issue: false hasContentIssue false

On Subsequence Weighted Products

Published online by Cambridge University Press:  21 July 2005

Y. O. HAMIDOUNE
Affiliation:
Université Pierre et Marie Curie, E. Combinatoire, Case 189, 4 Place Jussieu, 75005 Paris, France (e-mail: yha@ccr.jussieu.fr)
D. QUIROZ
Affiliation:
Universidad Simón Bolívar, Departamento de Matemática, Ap. 89000, Caracas, Venezuela (e-mail: dquiroz@usb.ve)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let $G$ be a finite group of order $n$ and let $k$ be a natural number. Let $\{x_i : i\in 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 $ \{ \sigma_i : 1\leq i \leq k \} $ be a family of permutations of $G$ such that $\sigma_i(1)=1$ for all $i$. We obtain the following result.

There are pairwise distinct elements $i_1, i_2, \dots ,i_k\in I$ such that \[ \prod_{1\leq j\leq k } \sigma_j \big(v^{-1}x_ {i_j }\big) =1.\]

Information

Type
Paper
Copyright
© 2005 Cambridge University Press