A combinatorial approach to doubly transitive permutation groups.
From MaRDI portal
Recommendations
- A computation of some multiply homogeneous superschemes from transitive permutation groups.
- A combinatorial approach to transitive extensions of generously unitransitive permutation groups
- Fast recognition of doubly transitive groups
- Doubly-transitive permutation groups
- scientific article; zbMATH DE number 4047925
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3811825 (Why is no real title available?)
- scientific article; zbMATH DE number 3955194 (Why is no real title available?)
- Association schemes, superschemes, and relations invariant under permutation groups
- Characters of finite quasigroups. IV: Products and superschemes
- Computing isomorphisms of association schemes and its application
- Extensions of designs and groups: projective, symplectic and certain affine groups
- On transitive extensions of finite permutation groups
- Several remarks on transitive extensions of finite permutation groups
Cited in
(9)- scientific article; zbMATH DE number 645265 (Why is no real title available?)
- Fast recognition of doubly transitive groups
- A combinatorial approach to transitive extensions of generously unitransitive permutation groups
- On a class of doubly, but not triply transitive permutation groups
- A computation of some multiply homogeneous superschemes from transitive permutation groups.
- scientific article; zbMATH DE number 3897187 (Why is no real title available?)
- RETRACTED: Solutions of the equilibrium equations with finite mass subject
- Doubly transitive automorphism groups of combinatorial surfaces
- scientific article; zbMATH DE number 6438886 (Why is no real title available?)
This page was built for publication: A combinatorial approach to doubly transitive permutation groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925001)