Z. Galil, C.M. Hoffmann, E.M. Luks, C.P. Schnorr, A. Weber An O(nZ log n) deterministic and an O(n3) Las Vegas isomorphism test for trivalent graphs, J. ACM, 34 (1987), 513-531.

Digital Library

Google Scholar

[6]

S.P. Glasby and M.C. Slattery, Computing intersections and normalizers in soluble groups, J. Symb. Comp., 9 (1990), 637-651.

Digital Library

Google Scholar

[7]

D.F. Holt, The computation of normalizers in permutation groups, J. Symb. Comp, 12 (1991), 498-516.

Digital Library

Google Scholar

[8]

W.M. Kantor and E.M. Luks, Computing in quotient groups, Proc. 22nd ACM Symposium on Theory of Computing, 1990, 524-533.

Digital Library

Google Scholar

[9]

D.E. Knuth, Notes on efficient representation of perm groups, Combinatorica, 11 (1991), 57-68.

Crossref

Google Scholar

[10]

E.M. Luks, Parallel algorithms for permutation groups and graph zsomorphism, Proc. 27th IEEE FOCS, 1986, 292-302.

Digital Library

Google Scholar

[11]

E.M. Luks, Computing in solvable matrix groups, Proc. 33rd IEEE Symp. on the Foundations of Comp. Sci., 1992, 111-120.

Digital Library

Google Scholar

[12]

E.M. Luks, Permutation groups and polynomialtime computation, in Groups and Computation, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 11, Amer. Math. Soc, 1993, ed. L. Finkelstein and W. Kantor, 139-175.

Google Scholar

[13]

E.M. Luks and P. McKenzie, Parallel computation in solvable permutation groups J. Comp. Syst. Sci., 37 (1988), 39-62

Digital Library

Google Scholar

[14]

M. SchSnert et al., GAP, Groups, Algorithms and Programming, Lehrstuhl D fiir Mathematik, Rheinisch Westf~1ische Technische Hochschule, Aachen, Germany, 3ra edition, 1993.

Google Scholar

Cited By

View all

Luks EMiyazaki TGiusti M(2002)Polynomial-time normalizers for permutation groups with restricted composition factorsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780529(176-183)Online publication date: 10-Jul-2002
https://dl.acm.org/doi/10.1145/780506.780529
Rákóczi F(1995)Fast recognition of the nilpotency of permutation groupsProceedings of the 1995 international symposium on Symbolic and algebraic computation10.1145/220346.220380(265-269)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.1145/220346.220380

Index Terms

Computing normalizers in permutation p-groups
1. Mathematics of computing
  1. Discrete mathematics
    1. Combinatorics
      1. Permutations and combinations
  2. Mathematical analysis
    1. Numerical analysis
      1. Computations on matrices
      2. Computations on polynomials

Recommendations

Constructing normalisers in finite soluble groups

This paper describes algorithms for constructing a Hall @p-subgroup H of a finite soluble group G and the normaliser N"G(H). If G has composition length n, then H and N"G(H) can be constructed using O(n^4 log |G|) and O(n^5 log |G|) group ...
Automorphism groups of tetravalent Cayley graphs on regular p-groups

Let Cay(G,S) be a connected tetravalent Cayley graph on a regular p-group G and let Aut(G) be the automorphism group of G. In this paper, it is proved that, for each prime p<>2,5, the automorphism group of the Cayley graph Cay(G,S) is the semidirect ...
Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms

A nonidentity element of a permutation group is said to be semiregular if all of its orbits have the same length. The work in this paper is linked to 6 where the problem of existence of semiregular automorphisms in vertex-transitive digraphs was posed. ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

ISSAC '94: Proceedings of the international symposium on Symbolic and algebraic computation

August 1994

359 pages

ISBN:0897916387

DOI:10.1145/190347

Chairman:
Malcolm MacCallum
QMW, London, UK

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 August 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ISSAC94

Sponsor:

SIGSAM

ISSAC94: International Symposium on Symbolic and Algebraic Computation

July 20 - 22, 1994

Oxford, United Kingdom

Acceptance Rates

Overall Acceptance Rate 395 of 838 submissions, 47%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
217
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)10

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Luks EMiyazaki TGiusti M(2002)Polynomial-time normalizers for permutation groups with restricted composition factorsProceedings of the 2002 international symposium on Symbolic and algebraic computation10.1145/780506.780529(176-183)Online publication date: 10-Jul-2002
https://dl.acm.org/doi/10.1145/780506.780529
Rákóczi F(1995)Fast recognition of the nilpotency of permutation groupsProceedings of the 1995 international symposium on Symbolic and algebraic computation10.1145/220346.220380(265-269)Online publication date: 1-Apr-1995
https://dl.acm.org/doi/10.1145/220346.220380

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Constructing normalisers in finite soluble groups

Automorphism groups of tetravalent Cayley graphs on regular p-groups

Permutation Groups, Vertex-transitive Digraphs and Semiregular Automorphisms