Bibliography
- [Atk75]Article
An algorithm for finding the blocks of a permutation group.
Math. Comp., 29:911–913, 1975. - [BC82]Article
Computing with permutation and matrix groups I: Normal closure, commutator subgroups, series.
Math. Comp., 39:671–680, 1982. - [Bea93]PhD Thesis
Algorithms for finite groups.
PhD thesis, University of Chicago, 1993.Cited in 1 page
- [BLGN+03a]Article
A black-box algorithm for recognising finite symmetric and alternating groups, I.
Trans. Amer. Math. Soc., pages 2097–2113, 2003.Cited in 1 page
- [BP00]Article
Fast constructive recognition of a black box group isomorphic to $S_n$ or $A_n$ using Goldbach's conjecture.
J. Symbolic Comp., 29:33–57, 2000. - [But85]Article
Effective computation with group homomorphisms.
J. Symbolic Comp., 1:143–157, 1985. - [But94]Article
An inductive schema for computing conjugacy classes in permutation groups.
Mathematics of Computation, 62(205):363–383, 1994.Cited in 1 page
- [CB92]Article
Structural computation in finite permutation groups.
CWI Quarterly, 5(2):127–160, 1992. - [CC91]Article
Recognizing doubly transitive groups.
J. Symb. Comp., 12(4/5):459–474, 1991.Cited in 1 page
- [CCH97]Article
Computing Sylow subgroups in permutation groups.
J. Symb. Comp., 24(3/4):303–316, 1997.Cited in 1 page
- [CCH01b]Article
Computing the subgroups of a permutation group.
J. Symb. Comp., 31:149–161, 2001.Cited in 1 page
- [CFL89]Conference
Reduction of group constructions to point stabilizers.
In Proc. of International Symposium on Symbolic and Algebraic Computation ISSAC '89, pages 351–356. ACM, 1989.Cited in 1 page
- [CH97]Article
Computing chief series, composition series and socles in large permutation groups.
J. Symb. Comp., 24(3/4):285–301, 1997. - [CH03]Article
Automorphism group computation and isomorphism testing in finite groups.
J. Symbolic Comp., 35(3):241–267, 2003.Cited in 1 page
- [CH04]Article
Computing maximal subgroups of finite groups.
J. Symbolic Comp., 37(5):589–609, 2004.Cited in 1 page
- [CHSS03]Reference
Computing subgroups of low index in a finite group, 2003.
Cited in 1 page
- [CLGM+95]Article
Generating random elements of a finite group.
Comm. Algebra, 23(13):4931–4948, 1995.Cited in 1 page
- [CS]Preprint
On the computation of normal subgroups in permutation groups.
to appear, International Journal of Algebra and Computation. - [CS97]Conference
On the computation of conjugacy classes in permutation groups.
In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, pages 392–399. Association for Computing Machinery, 1997.Maui, July 21–23, 1997.
Cited in 1 page
- [Geb00]Article
Constructing a short defining set of relations for a finite group.
J. Algebra, 233:526–542, 2000.Cited in 1 page
- [HL03]ConferenceIn Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pages 156–160. ACM, New York, 2003.
- [Hol84]Conference
The calculation of the Schur multiplier of a permutation group.
In Computational group theory (Durham, 1982), pages 307–319. Academic Press, London, 1984.Cited in 1 page
- [Hol85a]Article
A computer program for the calculation of a covering group of a finite group.
J. Pure Appl. Algebra, 35(3):287–295, 1985.Cited in 1 page
- [Hol85b]Article
The mechanical computation of first and second cohomology groups.
J. Symbolic Comp., 1(4):351–361, 1985.Cited in 1 page
- [JLNP13]Article
Fast recognition of alternating groups of unknown degree.
J. Algebra, 392:315–335, 2013.Cited in 1 page
- [Kan91]Article
Finding composition factors of permutation groups of degree $n\leq 10^ 6$.
J. Symbolic Comp., 12(4/5):517–526, 1991. - [Leo80]Article
On an algorithm for finding a base and a strong generating set for a group given by generating permutations.
Math. Comp., 35(151):941–974, 1980.Cited in 1 page
- [Leo97]Conference
Partitions, refinements, and permutation group computation.
In L. Finkelstein and W. M. Kantor, editors, Groups and Computation II, volume 28 of Dimacs series in Discrete Mathematics and Computer Science, pages 123–158, Providence R.I., 1997. Amer. Math. Soc.Cited in 3 pages
Conjugacy (also Conjugacy, citation 2)
Subgroups (also Subgroups, citation 2, Subgroups, citation 3, Subgroups, citation 4, Subgroups, citation 5)
Ordered Partition Stacks (also Ordered Partition Stacks, citation 2, Ordered Partition Stacks, citation 3, Ordered Partition Stacks, citation 4, Ordered Partition Stacks, citation 5, Ordered Partition Stacks, citation 6, Ordered Partition Stacks, citation 7)
- [LGPS91]Article
Computing with group homomorphisms.
J. Symbolic Comp., 12(4/5):527–532, 1991. - [LNPS06]Article
A reduction algorithm for for large-base primitive permutation groups.
LMS J. Comput. Math., 9:159–173, 2006. - [Luk93]Conference
Permutation groups and polynomial-time computation.
In Groups and computation (New Brunswick, NJ, 1991), volume 11 of DIMACS Ser. Discrete Math. Theoret. Comput. Sci., pages 139–175. Amer. Math. Soc., 1993. - [McK81]Article
Practical Graph Isomorphism.
Congressus Numerantium, 30:45–87, 1981. - [Min98]J. Symbolic Comput., 26(1):89–95, 1998.
Cited in 1 page
- [MN89]Article
Some remarks on the computation of conjugacy classes of soluble groups.
Bull. Austral, Math. Soc., 40(2):281–292, 1989.Cited in 1 page
- [Neu86]Conference
Some algorithms for computing with finite permutation groups.
In E. F. Robertson and C. M. Campbell, editors, Groups - St. Andrews 1985, number 121 in London Math. Soc. Lecture Notes Series, 1986. - [Ric73]Master's Thesis
Group: a computer system for group-theoretic calculations.
Master's thesis, Department of Pure Mathematics, University of Sydney, September 1973. - [Sch90a]Article
Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen.
Bayreuther Mathematische Schriften, 31:109–143, 1990. - [Ser03]Book
Permutation Group Algorithms, volume 152 of Cambridge Tracts in Mathematics.
Cambridge University Press, Cambridge, 2003.x+264 pages, ISBN 0-521-66103-X. - [Sim90]Article
Computing the order of a solvable permutation group.
J. Symb. Comp., 9(5/6):699–705, 1990. - [SS94]Conference
Finding blocks of imprimitivity in small-base groups in nearly linear time.
In Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., pages 154–157, 1994. - [Ung]Preprint
Computing chief series of a large permutation group.
In preparation. - [Ung06a]Article
Computing the character table of a finite group.
J. Symbolic Comp., 41(8):847–862, 2006.Cited in 1 page
- [Ung06b]Article
Computing the solvable radical of a permutation group.
J. Algebra, 300(1):305–315, 2006.