A fast cyclic base change for permutation groups
Pages 224 - 232
References
[1]
L. Babai, "Monte-Carlo Algorithms in Graph Isomorphism Testing", Universit6 de Montr6aI Tech. Report D.M.S. 79-10 (1979), Dep. Math. et. St, at.
[2]
L. Babai, G. Cooperman, L. Finkelstein, E.M. Luks, and A. Seress, "Fast, Monte Carlo Algorithms for Permutation Gloups", Proc. 23Id ACM STOC (1991), pp. 90-100.
[3]
L. Babai, G. Cooperman, L. Finkelsteln, and .~. Seress, "Nearly Linea,r "l-'ime AlgoIithms foi Permutation Gloups with ~ Small Base", Proc. of the 199i h)t.ernational Syn~posium on Symbolic and Algebraic Con~puration (tSSAC'91), Bonn, pp 200-2()9, July, 1991.
[4]
L. Bahai and E. Szemer6di, "On the Complexity of Matrix Group Problems I '" Proc. 25th IEEE FOCS (1984), Palm Beach, FL. pp. 229-2-t0.
[5]
C.A. Brown, L. Finkelsteil~, and P.W. Puidom, "A New Base Change Atgorit.hm fol Perlnnt.ation Groups", SIAM 1. C'omputtng 18 (t989), pp. 1037-1047.
[6]
C.A. Blown, L. Finkelstein, and P.\V. Purdom, ~Backtrack Searching in the PIesence of Symmetry", Proc. of the 6th International Conference on Algebraic Algorithn~s and Error Correcting Codes (AAECC-6, Rome. 1988), Springel Verlag Lecture Notes in Computer Sciertce, Vol. 357, pp 99-110
[7]
G. Butler and C. Lain, 'qsomorphtsm Testing of Combinatorial Objects", .1. of Symbolic (:omput.ation 1. (1~85), pp 363-as~.
[8]
J.} Caution, ~An Introductaon to the Group Theory Language, Ca.yley", iu C'omputational Grol~p Theoiy, edited by M.D. At.klnson, Aca.demlc PIess, 198i, pp. 145-18.t
[9]
H. Chet~o{{, "A Measure of As~lllI~toti( Efflcieltc3 for Tests of a Ilypot}~es}s Based o~ the Snn~ o{ Obsclvations", ~'~1sna/s of Math Statistics 23, 1952. pp,it)3- 507.
[10]
G. Cooperman and L. Finkelstein, "New Methods for Using Cayley Graphs in Interconnection Networks", Discrete Applied Mathematics, Special Issue on Interconnection Networks, in press.
[11]
G. Cooperman and L. Finkelstein, "A Strong Generating Test and Short Presentations for Permutation Groups", d. Symbolic Computation 12 (1991), pp. 475- 497.
[12]
G. Cooperman and L. Finketstein, "A Random Base Change Algorithm for Permutation Groups", Y. Symbolic Computation, under revision.
[13]
G. Cooperman, L. Finketstein and E. Luks, "Reduction of Group Constructions to Point Stabilizers", Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC 89), ACM Press, pp. 351-356.
[14]
G. Cooperman, L. Finkelstein and N. Sarawagi, "A Random Base Change Algorithm for Permutation Groups", Proc. of i990 International Symposium on Symbolic and Algebraic Computation, (ISSAC 90, Tokyo), ACM Press and Addison-Wesley (1990), pp. 161- 168.
[15]
M. Jerrum, "A Compact Representation for Permutation Groups", d. Algorithms 7 (1986), pp. 60-78.
[16]
C.W.H. Lam, "The Search for a Finite Projective Plane of Order t0", American Mathematical Monthly 98, (1991), pp. 305-318.
[17]
J. Leon, "On an Algorithm for Finding a Base and Stiong Generating Set for a Group Given by a Set of Generating Permutations", Math. Comp. 35 (t980), pp. 941-974.
[18]
J. Leon, "Computing Automorphism Groups of Combinatorial Objects", in Computa.tional Gro~p Theory, edited by M. D. Atkinson, Academic Press (1984), pp. 321-337.
[19]
C.C. Sims, "Computation with Permutation Groups", in Proc. Second Symposium on Symbolic and Algebraic Manipulation, edited by S.R Petrick, ACM Press, New York, 197t, pp. 23-28.
Index Terms
- A fast cyclic base change for permutation groups
Recommendations
On the permutation groups of cyclic codes
We classify the permutation groups of cyclic codes over a finite field. As a special case, we find the permutation groups of non-primitive BCH codes of prime length. In addition, the Sylow p-subgroup of the permutation group is given for many cyclic ...
Permutation Groups with a Cyclic Regular Subgroup and Arc Transitive Circulants
A description is given of finite permutation groups containing a cyclic regular subgroup. It is then applied to derive a classification of arc transitive circulants, completing the work dating from 1970's. It is shown that a connected arc transitive ...
Graphical cyclic permutation groups
We establish conditions for a permutation group generated by a single permutation of a prime power order to be an automorphism group of a graph or an edge-colored graph. This corrects and generalizes the results of the two papers on cyclic permutation ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1992 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 August 1992
Check for updates
Qualifiers
- Article
Conference
ISSAC92: International Symposium on Symbolic Algebraic Computation
July 27 - 29, 1992
California, Berkeley, USA
Acceptance Rates
Overall Acceptance Rate 395 of 838 submissions, 47%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 270Total Downloads
- Downloads (Last 12 months)27
- Downloads (Last 6 weeks)3
Reflects downloads up to 11 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in