×

Computing character degrees via a Galois connection. (English) Zbl 1456.20005

Summary: 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\mathrm{Gal}(E/F)\). However, the analysis when \(|F|\) is a Mersenne prime is more complicated, so certain cases were omitted from that paper. The present exposition, which is a reworking of the previous article, provides a uniform analysis over all the families, including the previously undetermined ones. In the group \(C\rtimes \mathrm{Gal}(E/F)\), we use the Galois connection to calculate stabilizers of linear characters, and these stabilizers determine the full character degree set. This is shown for each subgroup \(C\leq E^\times\) which satisfies the condition that every prime dividing \(|E^\times :C|\) divides \(|F^\times|\).

MSC:

20C15 Ordinary representations and characters
06A15 Galois correspondences, closure operators (in relation to ordered sets)
Full Text: DOI

References:

[1] I. M. Isaacs,Character Theory of Finite Groups, Academic Press, San Diego, 1976. · Zbl 0337.20005
[2] O. Manz and T. R. Wolf,Representations of Solvable Groups, Cambridge University Press, Cambridge, 1993. · Zbl 0928.20008
[3] J. K. McVey, Prime divisibility among degrees of solvable groups,Comm. Algebra,32(2004) 3391-3402. · Zbl 1077.20009
[4] J. K. McVey, On a Galois connection between the subfield lattice and the multiplicative subgroup lattice,Pacific J. Math.264(2013) 213-219. · Zbl 1310.06006
[5] J. Riedl, Character degrees, class sizes, and normal subgroups of a certain class ofp-groups.”J. Algebra218(1999) 190-215. · Zbl 0932.20015
[6] K.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.