Constructing transitive permutation groups.

DOI10.1016/j.jsc.2004.08.002zbMath1131.20003OpenAlexW1974562197MaRDI QIDQ2456530

Alexander Hulpke

Publication date: 19 October 2007

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2004.08.002

zbMATH Keywords

transitive permutation groupscomputation

Mathematics Subject Classification ID

Related Items (37)

Imprimitive permutations in primitive groups ⋮ A non-Schurian coherent configuration on 14 points exists ⋮ Transitive hyperovals ⋮ ON THE CLASSIFICATION OF QUANDLES OF LOW ORDER ⋮ Computing normalisers of intransitive groups ⋮ The transitive groups of degree 48 and some applications ⋮ Permutation codes with specified packing radius ⋮ Constructing error-correcting binary codes using transitive permutation groups ⋮ Full classification of permutation rational functions and complete rational functions of degree three over finite fields ⋮ Classification of Cyclic Steiner Quadruple Systems ⋮ Connected quandles and transitive groups ⋮ Rank three innately transitive permutation groups and related 2-transitive groups ⋮ A census of small transitive groups and vertex-transitive graphs ⋮ Explicit Tamagawa numbers for certain algebraic tori over number fields ⋮ Digital collections of examples in mathematical sciences ⋮ Computation of Galois Groups in magma ⋮ Stronger arithmetic equivalence ⋮ A census of small Schurian association schemes ⋮ On small discriminants of number fields of degree 8 and 9 ⋮ On triangles in derangement graphs ⋮ Computing subfields of number fields and applications to Galois group computations ⋮ Constructing finite simple solutions of the Yang-Baxter equation ⋮ Weighted trees with primitive edge rotation groups ⋮ Improved methods for the construction of relative invariants for permutation groups ⋮ New Constructions of Groups Without Semiregular Subgroups ⋮ Computing the soluble radical of a permutation group. ⋮ Semitransitive subsemigroups of the symmetric inverse semigroups. ⋮ The distinguishing number of quasiprimitive and semiprimitive groups ⋮ Numerical calculation of three-point branched covers of the projective line ⋮ ANTS XIII. Proceedings of the thirteenth algorithmic number theory symposium, University of Wisconsin-Madison, WI, USA, July 16--20, 2018 ⋮ Invariants for the computation of intransitive and transitive Galois groups ⋮ A new table of permutation codes ⋮ Computation of Hopf Galois structures on separable extensions and classification of those for degree twice an odd prime power ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Computing splitting fields using Galois theory and other Galois constructions ⋮ On the number of conjugacy classes of a permutation group. ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic)

Uses Software

• GAP
• Magma
• MeatAxe
• TransGrp

Cites Work

• Studies of the lattice of subgroups of finite groups using a programmable electronic dual machine
• Computing the order of a solvable permutation group
• The primitive soluble permutation groups of degree less than 256
• Permutation group algorithms based on partitions. I: Theory and algorithms
• The groups of order at most 1000 except 512 and 768
• Computing subgroups invariant under a set of automorphisms
• The transitive groups of degree fourteen and fifteen
• Peakword condensation and submodule lattices: An application of the Meat- Axe
• Short presentations for finite groups
• The Magma algebra system. I: The user language
• The affine primitive permutation groups of degree less than 1000.
• The transitive groups of degree twelve
• On finite simple groups of characteristic 2 type
• Some remarks on the computation of complements and normalizers in soluble groups
• Computing maximal subgroups of finite groups.
• Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
• The transitive groups of degree up to eleven⁺
• The primitive permutation groups of degree less than 1000
• On minimal faithful permutation representations of finite groups
• On Transitive Permutation Groups
• The Solvable Primitive Permutation Groups of Degree at Most 6560
• Computing the subgroups of a permutation group
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing transitive permutation groups.