Constructing transitive permutation groups.

DOI10.1016/J.JSC.2004.08.002zbMATH Open1131.20003OpenAlexW1974562197MaRDI QIDQ2456530FDOQ2456530

Authors: A. 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

Recommendations

• On Transitive Permutation Groups
• The transitive groups of degree twelve
• The Transitive Permutation Groups of Degree 32
• scientific article; zbMATH DE number 947812
• Computing the maximal subgroups of a permutation group. I

zbMATH Keywords

transitive permutation groupscomputation

Mathematics Subject Classification ID

Multiply transitive finite groups (20B20) Subgroups of symmetric groups (20B35)

Cites Work

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

Cited In (49)

• Computing normalisers of intransitive groups
• Transitive permutation representation for symmetrically generated groups
• Computing splitting fields using Galois theory and other Galois constructions
• Computing Galois groups of polynomials (especially over function fields of prime characteristic)
• New lower bounds on \(q\)-ary error-correcting codes
• Full classification of permutation rational functions and complete rational functions of degree three over finite fields
• On the classification of quandles of low order
• On the problem of computing the subdegrees of transitive permutation groups
• Transitive hyperovals
• Explicit Tamagawa numbers for certain algebraic tori over number fields
• On small discriminants of number fields of degree 8 and 9
• On the number of conjugacy classes of a permutation group.
• Stronger arithmetic equivalence
• Generating minimally transitive permutation groups.
• Computation of Hopf Galois structures on separable extensions and classification of those for degree twice an odd prime power
• On Transitive Subgroups of S₁₈
• Connected quandles and transitive groups
• Zen and the art of database maintenance
• The transitive groups of degree twelve
• The Solvable Primitive Permutation Groups of Degree at Most 6560
• Rank three innately transitive permutation groups and related 2-transitive groups
• Constructing error-correcting binary codes using transitive permutation groups
• Computing subfields of number fields and applications to Galois group computations
• The transitive groups of degree 48 and some applications
• Permutations which make transitive groups primitive.
• The Transitive Permutation Groups of Degree 32
• Numerical calculation of three-point branched covers of the projective line
• The distinguishing number of quasiprimitive and semiprimitive groups
• Computing the soluble radical of a permutation group.
• A census of small Schurian association schemes
• On fake subfields of number fields
• Weighted trees with primitive edge rotation groups
• Digital collections of examples in mathematical sciences
• A census of small transitive groups and vertex-transitive graphs
• Fast recognition of doubly transitive groups
• Permutation codes with specified packing radius
• Semitransitive subsemigroups of the symmetric inverse semigroups.
• On triangles in derangement graphs
• Constructing finite simple solutions of the Yang-Baxter equation
• New Constructions of Groups Without Semiregular Subgroups
• A non-Schurian coherent configuration on 14 points exists
• Classification of cyclic Steiner quadruple systems
• Norm one tori and Hasse norm principle. III: Degree 16 case
• Triple transitive groups and generalizations
• A new table of permutation codes
• Improved methods for the construction of relative invariants for permutation groups
• Imprimitive permutations in primitive groups
• Computation of Galois groups in Magma
• Invariants for the computation of intransitive and transitive Galois groups

Uses Software

• GAP
• Magma
• MeatAxe
• TransGrp

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

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