Computing modular and projective character degrees of soluble groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

AFFINE SUBGROUPS OF THE CLASSICAL GROUPS AND THEIR CHARACTER DEGREES

In this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. In [4] Gow obtained certain character degrees for all of the affine subgroups of the classical groups. We apply the method of Fischer to the above groups and, in addition to the character degrees given in [4], we obtain some ne...

متن کامل

computing character degrees via a galois connection

in a previous paper, the second author established that, given finite fields $f < e$ and certain subgroups $c leq e^times$, there is a galois connection between the intermediate field lattice ${l mid f leq l leq e}$ and $c$'s subgroup lattice. based on the galois connection, the paper then calculated the irreducible, complex character degrees of the semi-direct product $c rtimes {rm gal} (e/f)$...

متن کامل

affine subgroups of the classical groups and their character degrees

in this paper we describe how the degrees of the irreducible characters of the affine subgroups of the classical groups under consideration can be found inductively. in [4] gow obtained certain character degrees for all of the affine subgroups of the classical groups. we apply the method of fischer to the above groups and, in addition to the character degrees given in [4], we obtain some new ch...

متن کامل

Character degrees of p-groups and pro-p groups

In the 1970s, Isaacs conjectured that there should be a logarithmic bound for the length of solvability of a p-group G with respect to the number of different irreducible character degrees of G. So far, there are just a few partial results for this conjecture. In this note, we say that a pro-p group G has property (I) if there is a real number D = D(G) that just depends on G such that for any o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Symbolic Computation

سال: 1990

ISSN: 0747-7171

DOI: 10.1016/s0747-7171(08)80073-9