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

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


Constructive Matrix and Orderable Groups
โœ V. A. Roman'kov; N. G. Khisamiev ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer US ๐ŸŒ English โš– 150 KB
Constructing Permutation Representations
โœ 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
โœ 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

Constructible hypergraphs
โœ Christian Schindler ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 661 KB

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

Constructible Convex Sets
โœ Borwein, Jonathan M. ;Vanderwerff, Jon D. ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Springer ๐ŸŒ English โš– 306 KB