A combinatorial approach to doubly transitive permutation groups.

DOI10.1016/J.DISC.2007.08.032zbMath1157.20003OpenAlexW2089913722MaRDI 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

algorithmsorbitsassociation schemesfinite permutation groupspoint stabilizerssuperschemesactions on ordered triplesdoubly transitive permutation groupstransitive extensions

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Association schemes, strongly regular graphs (05E30) Multiply transitive finite groups (20B20)

Related Items (1)

RETRACTED: Solutions of the equilibrium equations with finite mass subject

Uses Software

• GAP

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

This page was built for publication: A combinatorial approach to doubly transitive permutation groups.