Finding the smallest image of a set

DOI10.1145/1005285.1005319MaRDI QIDQ4657330zbMATH OpenOpenAlexFDO

Authors Steve Linton

Publication date 14 March 2005

Published in Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1005285.1005319

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Minimal and canonical images
• A compact representation for permutation groups
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Algorithmic Recognition of Group Actions on Orbitals
• Fast Management of Permutation Groups I

Cited in

(17)

• The monoids of orders eight, nine \& ten.
• There is no McLaughlin geometry
• Minimal and canonical images
• The transitive groups of degree 48 and some applications
• An algorithm for enumerating difference sets
• Generating custom propagators for arbitrary constraints
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• Enumerating set orbits.
• Extending symmetry reduction techniques to a realistic model of computation
• The Monoids of Order Eight and Nine
• On additive MDS codes over small fields
• Computing the group of an algebraic variety over a finite field
• Software for proper vertex-colouring exploiting graph symmetry
• Minimal representatives of endofunctions
• Computing canonical images in permutation groups with graph backtracking
• Affine vector space partitions
• On the constructive orbit problem

This page was built for publication: Finding the smallest image of a set

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