Perfect refiners for permutation group backtracking algorithms

DOI10.1016/j.jsc.2022.04.007OpenAlexW4226417683MaRDI QIDQ2156355

Wilf A. Wilson, Christopher Jefferson, Rebecca Waldecker

Publication date: 18 July 2022

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

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

zbMATH Keywords

permutation groupsbacktrack searchsearch algorithmsrefiners

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Group theory and generalizations (20-XX) Permutation groups (20Bxx)

Related Items (2)

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

Uses Software

• Magma

Cites Work

• Permutation group algorithms based on partitions. I: Theory and algorithms
• The Magma algebra system. I: The user language
• New refiners for permutation group search
• Permutation group algorithms based on directed graphs
• Computing normalisers of intransitive groups
• Section graphs for finite permutation groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Perfect refiners for permutation group backtracking algorithms