Computing normalizers in permutation groups

DOI10.1016/0196-6774(83)90043-3zbMath0552.20004OpenAlexW2014825433MaRDI QIDQ3344111

Gregory Butler

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90043-3

zbMATH Keywords

permutation groupsbasecommutatorlower central seriesupper central seriesnormal closuresFibonacci groupCAYLEYstrong generating setbacktrack algorithmsperformance statisticsSchreier method

Mathematics Subject Classification ID

Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05)

Related Items (9)

Towards Efficient Normalizers of Primitive Groups ⋮ Conjugacy of Subgroups of the General Linear Group ⋮ Computing in permutation and matrix groups. III: Sylow subgroups ⋮ A proof of Holt's algorithm ⋮ Canonical representation of polynomial expressions with indices ⋮ The computation of normalizers in permutation groups ⋮ Permutation group algorithms based on partitions. I: Theory and algorithms ⋮ An Inductive Schema for Computing Conjugacy Classes in Permutation Groups ⋮ The transitive groups of degree twelve

This page was built for publication: Computing normalizers in permutation groups