An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups (Q2211307): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Building up spacetime with quantum entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840945 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4605941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4231664 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting permutation representations of finite groups by polynomial algebra methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for decomposing representations of finite groups using invariant projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3236717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264357 / rank
 
Normal rank

Latest revision as of 01:23, 24 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups
scientific article

    Statements

    An algorithm for constructing irreducible decompositions of permutation representations of wreath products of finite groups (English)
    0 references
    11 November 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references