๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Construction of Large Permutation Representations for Matrix Groups II

โœ Scribed by Michael Weller

Publisher
Springer
Year
2001
Tongue
English
Weight
212 KB
Volume
11
Category
Article
ISSN
0938-1279

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Constructing Permutation Representations
Constructing Permutation Representations for Matrix Groups
โœ GENE COOPERMAN; LARRY FINKELSTEIN; MICHAEL TSELMAN; BRYANT YORK ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 465 KB

New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutat

Constructing matrix representations of f
Constructing matrix representations of finitely presented groups
โœ S.A. Linton ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 777 KB

The Todd-Coxeter coset enumeration algorithm is one of the most important tools of computational group theory. It may be viewed as a means of constructing permutation representations of finitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix repres

A theory for the construction of the irr
A theory for the construction of the irreducible representations of finite groups. II
โœ Esko Blokker ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 363 KB

## Abstract The restriction on a method for computing irreducible representations of finite groups, requiring that in the irreducible representation to be constructed, at least one group element has at least one nondegenerate eigenvalue, is removed. The method is thus shown to be applicable to an a

A labeling scheme for young tableaux spa
A labeling scheme for young tableaux spanning representations of permutation groupS(N)
โœ Sarma, C. R.; Nampoothiri, A. V. V. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 377 KB

A structure-dependent labeling scheme for the Standard Young Tableaux spanning the representations of the permutation group is outlined in the present work. This scheme is used to generate the representations of a select class of permutations such as dense cycles and general transpositions of the gr