William M. Kantor, Tim Penttila  Home/Search
Context Related
| uoregon.edu/~kantor/...kpentREFEREED.ps uoregon.edu/~kantor/PAPERS/kpent.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uoregon.edu/~kantor/research (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Let G be a simple primitive subgroup of Sn , specified in terms of a set of generating permutations. If jGj n 5 , efficient algorithms are presented that find "the most natural permutation representation" of G. For example, if G is a classical group then we find a suitable projective space underlying G. A number of related questions are considered. Our notion of "efficiency" takes into account many existing notions, ranging from practical to theoretical ones. 1991 Mathematics Subject... (Update)
Context of citations to this paper: More
...d = 6. In the latter three situations, switch to the permutation representation on the set of all points or hyperplanes (e.g. using [KP]) Find and output a minimal block system for G on Sigma. HISTORY: This will look familiar to some of you. I used this for an...
Cited by: More
Geometry in Computer Algebra Systems - Kantor (1994) (Correct)
Active bibliography (related documents): More All
1.0: Notes on Classical Groups - Cameron (Correct)
0.9: Computing in Solvable Matrix Groups - Luks (1992) (Correct)
0.5: Factorizations of Primitive Permutation Groups - Baumeister (1997) (Correct)
Similar documents based on text: More All
0.4: The Rank 3 Permutation Representations Of The Finite.. - Kantor, Liebler (1982) (Correct)
0.3: Constructive recognition of PSL(2, q) - Conder, Leedham-Green, O'Brien (Correct)
0.3: Computing with Matrix Groups using Permutation.. - Cooperman, Finkelstein.. (Correct)
BibTeX entry: (Update)
W. M. Kantor and T. Penttila, Reconstructing simple group actions (in preparation). http://citeseer.ist.psu.edu/139315.html More
@misc{ kantor-reconstructing,
author = "W. Kantor and T. Penttila",
title = "Reconstructing simple group actions",
text = "W. M. Kantor and T. Penttila, Reconstructing simple group actions (in preparation).",
url = "citeseer.ist.psu.edu/139315.html" }
Citations (may not include all citations):102 Atlas of finite groups (context) - Conway, Curtis et al. - 1985
80 Finite permutation groups (context) - Wielandt - 1964
39 Polynomial-time algorithms for permutation groups (context) - Furst, Hopcroft et al. - 1980
34 The subgroup structure of the finite classical groups (context) - --- - 1990
24 algorithms and programming (context) - Schonert - 1994
19 Black box classical groups (context) - 'A
18 Permutation groups in NC (context) - --- - 1987
15 the minimal degrees of projective representations of the fin.. (context) - Landazuri, Seitz - 1974
15 The geometry of the classical groups (context) - Taylor - 1992
14 Computational complexity and the classification of finite si.. (context) - Babai, Kantor et al. - 1983
13 Projective geometry (context) - Veblen, Young - 1916
11 Combinatorial tools for computational group theory - Cooperman, Finkelstein - 1993
8 An introduction to the group theory language Cayley (context) - Cannon - 1984
8 La g'eom'etrie des groupes classiques (context) - Dieudonn'e - 1963
6 Parallel algorithms for permutation groups and graph isomorp.. (context) - Luks - 1986
6 Department of Pure Mathematics (context) - Bosma, Cannon et al. - 1993
5 the orders of maximal subgroups of the finite classical grou.. (context) - Liebeck - 1985
4 The orders of the classical simple groups (context) - Artin - 1955
4 on groups and polynomial time computation (context) - Permutati - 1993
2 Permutation representations of the finite classical groups o.. (context) - Kantor - 1979
2 Sylow's theorem and parallel computation (context) - Mark - 1993
2 the orders of maximal subgroups of the finite exceptional gr.. (context) - --- - 1987
2 The maximal subgroups of the finite 8--dimensional orthogona.. (context) - Kleidman - 1987
1 Sylow subgroups in parallel (context) - ---, Luks
1 the orders of primitive permutation groups (context) - Praeger, Saxl - 1980
1 A minimal permutation representation of the Thompson simple .. (context) - Mazurov - 1988
1 A nearly linear time algorithm for Sylow subgroups of permut.. (context) - Morje - 1995
Documents on the same site (http://darkwing.uoregon.edu/~kantor/research.html): More
Permutation Group Algorithms Via Black Box Recognition Algorithms - Kantor, Seress (Correct)
New Flag-Transitive Affine Planes of Even Order - Kantor, Williams (1996) (Correct)
Short Presentations for Finite Groups - Babai, Goodman, Kantor, Luks.. (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC