Irreducible constituents of monomial representations.
From MaRDI portal
Publication:2457403
DOI10.1016/j.jsc.2006.09.002zbMath1126.20009OpenAlexW1993414556MaRDI QIDQ2457403
Publication date: 23 October 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2006.09.002
symbolic computationcomputational methodsmonomial charactersalgebraic computationordinary representations
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Operation of class sums on permutation modules
- Dixon's character table algorithm revisited
- A modification of the LLL reduction algorithm
- Factoring polynomials with rational coefficients
- Character theory of finite groups
- The character values of the irreducible constituents of a transitive permutation representation
- Regular representations of semisimple algebras, separable field extensions, group characters, generalized circulants, and generalized cyclic codes
- Computing the character table of a finite group.
- High speed computation of group characters
- THE CHARACTER VALUES OF MULTIPLICITY-FREE IRREDUCIBLE CONSTITUENTS OF A TRANSITIVE PERMUTATION REPRESENTATION
- Analysis of PSLQ, an integer relation finding algorithm
This page was built for publication: Irreducible constituents of monomial representations.
