Irreducible degrees divide the order of a finite -group and satisfy
The number of linear characters is . For a nontrivial finite -group this is at least unless the group is abelian, and every nonlinear degree is at least . A degree constituent is therefore impossible in the nonabelian case. If there are linear and degree-two characters, then
Thus the only degree collections are
with respectively .
For take the cyclic group . Every conjugacy class is a singleton, and its character table is
where .
For , take , where
and
. On the five classes
the four linear characters of , indexed by
, and its degree-two character are
The ten classes of are and . Its full table consists of
where runs over the above five rows and
runs over the two characters of . This explicitly gives eight linear and two degree-two rows.
For , take the dihedral group
Order its seven classes as
The four linear rows are
The three degree-two rows, for , are
The row norms and mutual inner products, weighted by the displayed class sizes, verify irreducibility and completeness.

Articles by others on the same topic (0)

There are currently no matching articles.