A combinatorial approach to doubly transitive permutation groups.
From MaRDI portal
Publication:925001
DOI10.1016/j.disc.2007.08.032zbMath1157.20003MaRDI QIDQ925001
Publication date: 29 May 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.032
algorithms; orbits; association schemes; finite permutation groups; point stabilizers; superschemes; actions on ordered triples; doubly transitive permutation groups; transitive extensions
68W30: Symbolic computation and algebraic computation
20B25: Finite automorphism groups of algebraic, geometric, or combinatorial structures
05E30: Association schemes, strongly regular graphs
20B20: Multiply transitive finite groups
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing isomorphisms of association schemes and its application
- Characters of finite quasigroups. IV: Products and superschemes
- Association schemes, superschemes, and relations invariant under permutation groups
- On transitive extensions of finite permutation groups
- Extensions of designs and groups: projective, symplectic and certain affine groups
- Several remarks on transitive extensions of finite permutation groups