Let G be a finite group of order n ≥ 2, (cursive Greek chi1,...,cursive Greek chin) an n-tuple of elements of G and A = (aij) a square matrix of order n such that aij = cursive Greek chiicursive Greek chij. We investigate how many different types of such matrices could exist for n = 2,3 and we deal with some of their properties. We show that for every group G the number of the ordered n-tuples corresponding to the same matrix is a multiple of |G|.

Counting squares of n-subsets in finite groups / M. Bianchi, A. Gillio, L. Verardi. - In: ARS COMBINATORIA. - ISSN 0381-7032. - 52(1999), pp. 97-114.

Counting squares of n-subsets in finite groups

M. Bianchi;
1999

Abstract

Let G be a finite group of order n ≥ 2, (cursive Greek chi1,...,cursive Greek chin) an n-tuple of elements of G and A = (aij) a square matrix of order n such that aij = cursive Greek chiicursive Greek chij. We investigate how many different types of such matrices could exist for n = 2,3 and we deal with some of their properties. We show that for every group G the number of the ordered n-tuples corresponding to the same matrix is a multiple of |G|.
n-subset
Settore MAT/02 - Algebra
1999
Article (author)
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2434/195260
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 1
  • ???jsp.display-item.citation.isi??? 0
social impact