Constructing transitive permutation groups.
From MaRDI portal
Publication:2456530
Recommendations
Cites work
- scientific article; zbMATH DE number 3136688 (Why is no real title available?)
- scientific article; zbMATH DE number 3989617 (Why is no real title available?)
- scientific article; zbMATH DE number 4055862 (Why is no real title available?)
- scientific article; zbMATH DE number 3717558 (Why is no real title available?)
- scientific article; zbMATH DE number 1262448 (Why is no real title available?)
- scientific article; zbMATH DE number 1263407 (Why is no real title available?)
- scientific article; zbMATH DE number 1302482 (Why is no real title available?)
- scientific article; zbMATH DE number 2151195 (Why is no real title available?)
- scientific article; zbMATH DE number 947812 (Why is no real title available?)
- scientific article; zbMATH DE number 894528 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- scientific article; zbMATH DE number 3067687 (Why is no real title available?)
- A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
- Computing maximal subgroups of finite groups.
- Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
- Computing subgroups invariant under a set of automorphisms
- Computing the maximal subgroups of a permutation group. I
- Computing the order of a solvable permutation group
- Computing the subgroups of a permutation group
- On Transitive Permutation Groups
- On finite simple groups of characteristic 2 type
- On minimal faithful permutation representations of finite groups
- Peakword condensation and submodule lattices: An application of the Meat- Axe
- Permutation group algorithms based on partitions. I: Theory and algorithms
- Short presentations for finite groups
- Some remarks on the computation of complements and normalizers in soluble groups
- Studies of the lattice of subgroups of finite groups using a programmable electronic dual machine
- The Magma algebra system. I: The user language
- The Solvable Primitive Permutation Groups of Degree at Most 6560
- The affine primitive permutation groups of degree less than 1000.
- The groups of order at most 1000 except 512 and 768
- The primitive permutation groups of degree less than 1000
- The primitive soluble permutation groups of degree less than 256
- The transitive groups of degree fourteen and fifteen
- The transitive groups of degree twelve
- The transitive groups of degree up to eleven+
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
- Transitive hyperovals
- On the problem of computing the subdegrees of transitive permutation groups
- 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.
- Generating minimally transitive permutation groups.
- Stronger arithmetic equivalence
- Computation of Hopf Galois structures on separable extensions and classification of those for degree twice an odd prime power
- Connected quandles and transitive groups
- On Transitive Subgroups of S18
- 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
- Computing subfields of number fields and applications to Galois group computations
- Constructing error-correcting binary codes using transitive permutation groups
- 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
- Weighted trees with primitive edge rotation groups
- On fake subfields of number fields
- Digital collections of examples in mathematical sciences
- A census of small transitive groups and vertex-transitive graphs
- Permutation codes with specified packing radius
- Fast recognition of doubly transitive groups
- Semitransitive subsemigroups of the symmetric inverse semigroups.
- On triangles in derangement graphs
- Constructing finite simple solutions of the Yang-Baxter equation
- A non-Schurian coherent configuration on 14 points exists
- New Constructions of Groups Without Semiregular Subgroups
- A new table of permutation codes
- Triple transitive groups and generalizations
- Classification of cyclic Steiner quadruple systems
- Improved methods for the construction of relative invariants for permutation groups
- Norm one tori and Hasse norm principle. III: Degree 16 case
- Imprimitive permutations in primitive groups
- Invariants for the computation of intransitive and transitive Galois groups
- Computation of Galois groups in Magma
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)
