Constructible Matrix Groups
โ Scribed by V. A. Roman'kov; N. G. Khisamiev
- Book ID
- 111570519
- Publisher
- Springer US
- Year
- 2004
- Tongue
- English
- Weight
- 153 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0002-5232
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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
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
The class A of finite manuals (i.e. hypergraphs formed by the cliques of finite graphs) is closed under the formation of sums and products. We define the class of constructible hypergraphs to be the smallest subclass of A which contains all finite classical manuals (i.e. hypergraphs having a single