1999
DOI: 10.2140/pjm.1999.187.317
|View full text |Cite
|
Sign up to set email alerts
|

Orbit sizes and character degrees

Abstract: The objective of this paper is to develop criteria that guarantee that a finite group G which acts faithfully on a vector space V possesses "many" orbits of different sizes. This has consequences on (classical and modular) character degrees of finite solvable groups.Introduction.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2000
2000
2006
2006

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 13 publications
(21 citation statements)
references
References 11 publications
0
21
0
Order By: Relevance
“…We also write d(G) to denote the minimal number of generators of G. We recall that the rank of a finite group G (we denote it by rk(G)) is the maximum of the numbers d(H), as H runs over the subgroups of G. We have been unable to find any reference to results of this type when the field is infinite. T. M. Keller has obtained results of this flavor for finite fields (see, for instance, Theorem 2.1 of [12]). We do not know whether a linear bound for the number of generators (or, perhaps, even for the rank) exists.…”
Section: Theorem Dmentioning
confidence: 93%
“…We also write d(G) to denote the minimal number of generators of G. We recall that the rank of a finite group G (we denote it by rk(G)) is the maximum of the numbers d(H), as H runs over the subgroups of G. We have been unable to find any reference to results of this type when the field is infinite. T. M. Keller has obtained results of this flavor for finite fields (see, for instance, Theorem 2.1 of [12]). We do not know whether a linear bound for the number of generators (or, perhaps, even for the rank) exists.…”
Section: Theorem Dmentioning
confidence: 93%
“…However, it is believed that the "right" bound is logarithmic and a lot of work has recently been done in this direction by T. Keller, who has essentially reduced the problem to p-groups. (See [13], [14], [15].) We believe that it should also be possible to improve the bound in Theorem A to a logarithmic bound, but for that, one would need to solve first the p-group case of the original problem.…”
Section: Then the Derived Length Of P Is Bounded By A Real-valued Funmentioning
confidence: 99%
“…(ii) In the notation of Lemma 2.10, the group E × A of order 2 2 · 3 · 5 has a normal subgroup of order 5 and acts faithfully on the elementary abelian group E of order 2 4 . Therefore E × A is isomorphic to a subgroup of N. But (i) tells us that E × A = N .…”
Section: The Semidirect Product Corresponding To the Natural Action Omentioning
confidence: 99%