The Transitive Permutation Groups of Degree 32
From MaRDI portal
Publication:3598050
DOI10.1080/10586458.2008.10129046zbMath1175.20004OpenAlexW2024772532MaRDI QIDQ3598050
Publication date: 29 January 2009
Published in: Experimental Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.em/1227121384
algorithmswreath productsconjugacy classes of subgroupsdata basestransitive permutation groups of degree 32
Symbolic computation and algebraic computation (68W30) Subgroups of symmetric groups (20B35) General theory for finite permutation groups (20B05) Multiply transitive finite groups (20B20) Characterization theorems for permutation groups (20B10)
Related Items
Settled polynomials over finite fields ⋮ ON THE CLASSIFICATION OF QUANDLES OF LOW ORDER ⋮ Minimal generation of transitive permutation groups ⋮ The transitive groups of degree 48 and some applications ⋮ Cores of cubelike graphs ⋮ 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 ⋮ Digital collections of examples in mathematical sciences ⋮ Stronger arithmetic equivalence ⋮ A census of small Schurian association schemes ⋮ Invariable generation of permutation and linear groups ⋮ On triangles in derangement graphs ⋮ Computing subfields of number fields and applications to Galois group computations ⋮ Improved methods for the construction of relative invariants for permutation groups ⋮ Mixed degree number field computations ⋮ Rationality problem for norm one tori in small dimensions ⋮ The distinguishing number of quasiprimitive and semiprimitive groups ⋮ Invariants for the computation of intransitive and transitive Galois groups ⋮ New lower bounds on \(q\)-ary error-correcting codes ⋮ Computing splitting fields using Galois theory and other Galois constructions ⋮ Computing Galois groups of polynomials (especially over function fields of prime characteristic)
