In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H aS dagger 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

Dolfi, S., Guralnick, R., Praeger, C., Spiga, P. (2013). Coprime subdegrees for primitive permutation groups and completely reducible linear groups. ISRAEL JOURNAL OF MATHEMATICS, 195(2), 745-772 [10.1007/s11856-012-0163-4].

Coprime subdegrees for primitive permutation groups and completely reducible linear groups

SPIGA, PABLO
2013

Abstract

In this paper we answer a question of Gabriel Navarro about orbit sizes of a finite linear group H aS dagger 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
Articolo in rivista - Articolo scientifico
coprime subdegrees
English
2013
195
2
745
772
none
Dolfi, S., Guralnick, R., Praeger, C., Spiga, P. (2013). Coprime subdegrees for primitive permutation groups and completely reducible linear groups. ISRAEL JOURNAL OF MATHEMATICS, 195(2), 745-772 [10.1007/s11856-012-0163-4].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/10281/48985
Citazioni
  • Scopus 8
  • ???jsp.display-item.citation.isi??? 8
Social impact