Calculating characters of \(p\)-groups (Q1813914): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3333220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High speed computation of group characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3871077 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Endliche Gruppen I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619223 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3903159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dixon's character table algorithm revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing character degrees in p-groups / rank
 
Normal rank

Latest revision as of 08:29, 15 May 2024

scientific article
Language Label Description Also known as
English
Calculating characters of \(p\)-groups
scientific article

    Statements

    Calculating characters of \(p\)-groups (English)
    0 references
    0 references
    25 June 1992
    0 references
    The author gives an algorithm for the computation of the characters of a \(p\)-group \(G\) given by a special power-commutator presentation for \(p\)- groups, called \(p\)-step generating series. This algorithm is a refinement of a former work of \textit{M. C. Slattery} [J. Symb. Comput. 2, 51-58 (1986; Zbl 0588.20006)]. It uses the fact that each irreducible character \(\chi\) of \(G\) is an induced character \(\lambda^ G\), where \(\lambda\) is a faithful linear character of a cyclic section \(C/K\) of \(G\), with \(K\triangleleft C\leq G\). The algorithm does not calculate all required sections and their irreducible characters and induces them up to \(G\) afterwards, but calculates the multiplicity with which each conjugacy class participates in these inductions by recursion. After this the linear characters of \(C/K\) can be computed and induced up to \(G\) easily. Thus it is possible just to print out the found character values instead of storing them into the workspace. Furthermore, an implementation of this algorithm in CAYLEY V3.6 is shown, and the benefits of different representations of the character values in the computer are pointed out. Finally, the author compares the run-time requirements of the resulting different implementations of this algorithm and the well known Dixon- Schneider Algorithm, that makes no use of any known structure of \(G\), for some groups.
    0 references
    algorithm
    0 references
    power-commutator presentation
    0 references
    \(p\)-groups
    0 references
    \(p\)-step generating series
    0 references
    irreducible character
    0 references
    induced character
    0 references
    cyclic section
    0 references
    linear characters
    0 references
    CAYLEY
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references