Fast computation of the centralizer of a permutation group in the symmetric group

DOI10.1016/j.jsc.2023.102287MaRDI QIDQ6149148

Rok Požar

Publication date: 5 February 2024

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

permutation groupalgorithms in group theorycentralizer problemSchreier tree

Mathematics Subject Classification ID

Symmetric groups (20B30) Computational methods for problems pertaining to group theory (20-08) Computational methods for problems pertaining to combinatorics (05-08)

Cites Work

• Group-theoretic algorithms and graph isomorphism
• Permutation group algorithms based on partitions. I: Theory and algorithms
• A random base change algorithm for permutation groups
• Subcomplete generalizations of graph isomorphism
• Perfect refiners for permutation group backtracking algorithms
• Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast computation of the centralizer of a permutation group in the symmetric group