Perfect refiners for permutation group backtracking algorithms

DOI10.1016/J.JSC.2022.04.007OpenAlexW4226417683MaRDI QIDQ2156355FDOQ2156355

Authors: Christopher Jefferson, Wilf A. Wilson, 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

Recommendations

• New refiners for permutation group search
• scientific article; zbMATH DE number 1004935
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Computing normalizers in permutation groups
• scientific article; zbMATH DE number 4123296

zbMATH Keywords

search algorithmspermutation groupsbacktrack searchrefiners

Mathematics Subject Classification ID

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

Cites Work

• The Magma algebra system. I: The user language
• Permutation group algorithms based on directed graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Title not available (Why is that?)
• Computing normalisers of intransitive groups
• Section graphs for finite permutation groups
• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• New refiners for permutation group search

Cited In (4)

• Fast computation of the centralizer of a permutation group in the symmetric group
• Perfect refiners for permutation group backtracking algorithms
• Vole
• Computing canonical images in permutation groups with graph backtracking

Uses Software

• Magma

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156355)