In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H ⊆ GL(V ) acting completely reducibly on a vector space V : if the H-orbits containing the vectors a and b have coprime lengths m and n, we prove that the H-orbit containing a + b has length mn. Such groups H are always reducible if n, m > 1. In fact, if H is an irreducible linear group, we show that, for every pair of non-zero vectors, their orbit lengths have a non-trivial common factor. In the more general context of finite primitive permutation groups G, we show that coprime non-identity subdegrees are possible if and only if G is of O’Nan-Scott type AS, PA or TW. In a forthcoming paper we will show that, for a finite primitive permutation group, a set of pairwise coprime subdegrees has size at most 2. Finally, as an application of our results, we prove that a field has at most 2 finite extensions of pairwise coprime indices with the same normal closure.

COPRIME SUBDEGREES FOR PRIMITIVE PERMUTATION GROUPS AND COMPLETELY REDUCIBLE LINEAR GROUPS / S. Dolfi; R. Guralnick; C. Praeger; P. Spiga. - In: ISRAEL JOURNAL OF MATHEMATICS. - ISSN 0021-2172. - STAMPA. - 195:(2013), pp. 745-772. [10.1007/s11856-012-0163-4]

COPRIME SUBDEGREES FOR PRIMITIVE PERMUTATION GROUPS AND COMPLETELY REDUCIBLE LINEAR GROUPS

DOLFI, SILVIO;
2013

Abstract

In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H ⊆ GL(V ) acting completely reducibly on a vector space V : if the H-orbits containing the vectors a and b have coprime lengths m and n, we prove that the H-orbit containing a + b has length mn. Such groups H are always reducible if n, m > 1. In fact, if H is an irreducible linear group, we show that, for every pair of non-zero vectors, their orbit lengths have a non-trivial common factor. In the more general context of finite primitive permutation groups G, we show that coprime non-identity subdegrees are possible if and only if G is of O’Nan-Scott type AS, PA or TW. In a forthcoming paper we will show that, for a finite primitive permutation group, a set of pairwise coprime subdegrees has size at most 2. Finally, as an application of our results, we prove that a field has at most 2 finite extensions of pairwise coprime indices with the same normal closure.
2013
195
745
772
S. Dolfi; R. Guralnick; C. Praeger; P. Spiga
File in questo prodotto:
File Dimensione Formato  
CoprimeSubdegrees.pdf

Accesso chiuso

Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 472.29 kB
Formato Adobe PDF
472.29 kB Adobe PDF   Richiedi una copia

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

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/778127
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 8
social impact