Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
From MaRDI portal
Publication:5145118
Recommendations
Cites work
- scientific article; zbMATH DE number 3745207 (Why is no real title available?)
- scientific article; zbMATH DE number 475365 (Why is no real title available?)
- scientific article; zbMATH DE number 556252 (Why is no real title available?)
- scientific article; zbMATH DE number 750952 (Why is no real title available?)
- scientific article; zbMATH DE number 854561 (Why is no real title available?)
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3341276 (Why is no real title available?)
- A class of semiprimitive groups that are graph-restrictive
- A theory of semiprimitive groups
- An O'Nan-Scott Theorem for Finite Quasiprimitive Permutation Groups and an Application to 2-Arc Transitive Graphs
- Bounding the composition length of primitive permutation groups and completely reducible linear groups
- Bounds and quotient actions of innately transitive groups
- Bounds on finite quasiprimitive permutation groups
- Finite permutation groups with a transitive minimal normal subgroup
- Graphs with a locally linear group of automorphisms
- Graphs with automorphism groups admitting composition factors of bounded rank
- Minimal Degrees of Primitive Permutation Groups, with an Application to Monodromy Groups of Covers of Riemann Surfaces
- Normalizers of primitive permutation groups
- On groups with every normal subgroup transitive or semiregular.
- On intransitive graph-restrictive permutation groups
- On locally semiprimitive graphs and a theorem of Weiss
- On the minimal degree of a primitive permutation group
- On the number of generators and composition length of finite linear groups
- On the order of arc-stabilisers in arc-transitive graphs with prescribed local group
- On the order of doubly transitive permutation groups
- On the order of uniprimitive permutation groups
- On the orders of Primitive Permutation Groups
- Permutation groups and Cartesian decompositions
- Permutation groups, minimal degrees and quantum computing.
- Permutation representations of nonsplit extensions involving alternating groups
- Seminormal and subnormal subgroup lattices for transitive permutation groups
- Simple groups, fixed point ratios and applications
- The Finite Simple Groups
- The Magma algebra system. I: The user language
- The distinguishing number of quasiprimitive and semiprimitive groups
- The faithful linear representations of least degree of \(S_n\) and \(A_n\) over a field of characteristic 2.
- The faithful linear representations of least degree of \(S_n\) and \(A_n\) over a field of odd characteristic
Cited in
(10)- Minimal degree, base size, order: selected topics on primitive permutation groups
- On groups with every normal subgroup transitive or semiregular.
- A polynomial bound for the number of maximal systems of imprimitivity of a finite transitive permutation group
- scientific article; zbMATH DE number 4183681 (Why is no real title available?)
- Permutation Groups in o-Minimal Structures
- The Minimal Base Size of Primitive Solvable Permutation Groups
- The distinguishing number of quasiprimitive and semiprimitive groups
- A theory of semiprimitive groups
- On finite permutation groups of rank three
- Bounds for Finite Semiprimitive Permutation Groups: Order, Base Size, and Minimal Degree
This page was built for publication: Bounds for finite semiprimitive permutation groups: order, base size, and minimal degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145118)
