The character values of the irreducible constituents of a transitive permutation representation

Archiv der Mathematik

Volumn 78, Issue 6, 2002, Pages 417-429

  Michler, G O ^a   Weller, M ^a  

^a UNIVERSITY OF DUISBURG ESSEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036625268     PISSN: 0003889X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00013-002-8266-5     Document Type: Article

References (13)

1. E. Bannai and T. Ito, Algebraic combinatorics I, Association Schemes. Menlo Park, California 1984.
2. W. Bosma and J. Cannon, MAGMA Handbook. Sydney 1993.
3. C.W. Curtis and I. Reiner, Methods of representation theory I. New York 1981.
4. J.D. Dixon, High Speed Computation of Group Characters. Numer. Math. 10, 446-450 (1970).
5. H.W. Gollan and T.W. Ostermann, Operation of class sums on permutation modules. J. Symbolic Comput. 9, 39-47 (1990).
6. D.G. Higman, Intersection matrices for finite permutation groups. J. Algebra 6, 22-42 (1967).
7. I.M. Isaacs, Character theory of finite groups. New York 1976.
8. Z. Janko, A new finite simple group with abelian Sylow 2-subgroups and its characterization. J. Algebra 3, 147-186 (1966).
9. P. Landrock, Finite group algebras and their modules. Cambridge 1983.
10. G.O. Michler, The character values of multiplicity-free irreducible constituents of a transitive permutation representation. Kyushu J. Math. 55, 75-106 (2001).
11. G.J.A. Schneider, Dixon's Character Table Algorithm revisited. J. Symbolic Comput. 9, 601-606 (1990).
12. M. Schönert et al., GAP 3.4 Manual (Groups, Algorithms and Programming). RWTH Aachen 1994.
13. 24)′. In preparation.