Permutation group algorithms based on partitions. I: Theory and algorithms

DOI10.1016/S0747-7171(08)80103-4zbMath0807.20001MaRDI QIDQ1192233

Jeffrey S. Leon

Publication date: 27 September 1992

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

zbMATH Keywords

algorithms; symmetric groups; conjugacy; permutation groups; normalizers; centralizers; bases; backtrack search; stabilizers; ordered partitions; set images; implementations; \({\mathcal R}\)-bases; computation of subgroups; coset intersections; coset type problems; group intersections; left cosets; refinement processes; set stabilizers; strong generating sets; subgroup-type problems

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20D30: Series and lattices of subgroups

20F05: Generators, relations, and presentations of groups

20-04: Software, source code, etc. for problems pertaining to group theory

Related Items

On leaf permutative theories and occurrence permutation groups, On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture, Towards Efficient Normalizers of Primitive Groups, An adaptive prefix-assignment technique for symmetry reduction, On the complexity of deduction modulo leaf permutative equations, Symmetry-based matrix factorization, The contact polytope of the Leech lattice, All \(\mathbb{Z}_ 4\) codes of type II and length 16 are known, Good integers and some applications in coding theory, Minimal and canonical images, New refiners for permutation group search, The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order, The average dimension of the hull of cyclic codes., Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets, Hulls of cyclic and negacyclic codes over finite fields, Constructions and bounds on quaternary linear codes with Hermitian hull dimension one, Linear codes with one-dimensional hull associated with Gaussian sums, Permutation group algorithms based on directed graphs, Optimal binary and ternary linear codes with hull dimension one, Hulls of linear codes revisited with applications, Hermitian hulls of constacyclic codes and a new family of entanglement-assisted quantum MDS codes, MDS linear codes with one-dimensional hull, A new construction of linear codes with one-dimensional hull, Linear codes with arbitrary dimensional hull and their applications to EAQECCs, A new method for constructing linear codes with small hulls, Hermitian hulls of constacyclic codes and their applications to quantum codes, Conjugacy classes and centralisers in wreath products, Perfect refiners for permutation group backtracking algorithms, New Galois hulls of generalized Reed-Solomon codes, Hulls of cyclic codes over \(\mathbb{Z}_4\), Linear codes with small hulls in semi-primitive case, Constructing transitive permutation groups., Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting), Computing symmetry groups of polyhedra, Exploiting Symmetries in Polyhedral Computations

Uses Software

• Cayley

Cites Work

• A general backtrack algorithm for the isomorphism problem of combinatorial objects
• Group-theoretic algorithms and graph isomorphism
• On the centralizers of involutions in finite groups. II
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Computing normalizers in permutation groups
• A probabilistic algorithm for computing minimum weights of large error-correcting codes
• On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
• Computing automorphism groups of error-correcting codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item