Finding possible permutation characters

DOI10.1006/JSCO.1998.0217zbMath0921.20013OpenAlexW2035988237MaRDI QIDQ1267072

Thomas Breuer, Götz Pfeiffer

Publication date: 9 August 1999

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1998.0217

zbMATH Keywords

irreducible charactersGaussian eliminationGAPLyons groupcharacters of finite groupsintegral solutions of systems of inequalitiespossible permutation characterstransitive permutation charactersvectors of multiplicities

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Ordinary representations and characters (20C15) Software, source code, etc. for problems pertaining to group theory (20-04) Representations of sporadic groups (20C34)

Related Items (6)

On permutation polytopes ⋮ Involutions in Conway's Largest Simple Group ⋮ Probabilistic generation of finite simple groups. II. ⋮ More Fibonacci-Bernoulli relations with and without balancing polynomials ⋮ Computing the table of marks of a cyclic extension ⋮ Unnamed Item

Uses Software

• GAP

This page was built for publication: Finding possible permutation characters