Efficient representation of perm groups

DOI10.1007/BF01375471zbMath0803.20005arXivmath/9201304MaRDI QIDQ1180408

Donald E. Knuth

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/9201304

zbMATH Keywords

algorithmpermutation groupgenerating permutationsgenerating transversal systemstrong generator set

Mathematics Subject Classification ID

Related Items (9)

Generation of Colourings and Distinguishing Colourings of Graphs ⋮ Almost simplep-obstructions in odd characteristic lie type groups^∗ ⋮ On-the-fly bisimilarity checking for fresh-register automata ⋮ Succinct representations of permutations and functions ⋮ Polynomial-time equivalence testing for deterministic fresh-register automata ⋮ Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas ⋮ Complexity classes of equivalence problems revisited ⋮ Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$ ⋮ Faster tensor canonicalization

Cites Work

• Unnamed Item
• Unnamed Item
• The mathematics of perfect shuffles
• The simple group of order 604,800
• A compact representation for permutation groups
• On the length of subgroup chains in the symmetric group

This page was built for publication: Efficient representation of perm groups