New refiners for permutation group search

DOI10.1016/j.jsc.2017.12.003zbMath1502.20002arXiv1608.08489OpenAlexW2963517760WikidataQ57990349 ScholiaQ57990349MaRDI QIDQ1757005

Markus Pfeiffer, Rebecca Waldecker, Christopher Jefferson

Publication date: 28 December 2018

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

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

zbMATH Keywords

permutation groupsbacktrack searchcomputational algebraalgorithmic group theorypartition backtrackrefiners

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Computational methods for problems pertaining to group theory (20-08)

Related Items (4)

Perfect refiners for permutation group backtracking algorithms ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Permutation group algorithms based on directed graphs ⋮ On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture

Uses Software

• GAP
• Magma
• nauty
• Traces
• Ferret

Cites Work

• Permutation group algorithms based on partitions. I: Theory and algorithms
• The Magma algebra system. I: The user language
• Practical graph isomorphism. II.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New refiners for permutation group search