A combinatorial approach to doubly transitive permutation groups.

DOI10.1016/j.disc.2007.08.032zbMath1157.20003MaRDI QIDQ925001

Izumi Miyamoto

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

zbMATH Keywords

algorithms; orbits; association schemes; finite permutation groups; point stabilizers; superschemes; actions on ordered triples; doubly transitive permutation groups; transitive extensions

Mathematics Subject Classification ID

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

RETRACTED: Solutions of the equilibrium equations with finite mass subject

Uses Software

• GAP

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item