A combinatorial approach to doubly transitive permutation groups.

DOI10.1016/J.DISC.2007.08.032MaRDI QIDQ925001zbMATH OpenOpenAlexFDO

Authors 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

actions on ordered triplesalgorithmsassociation schemesdoubly transitive permutation groupsfinite permutation groupsorbitspoint stabilizerssuperschemestransitive extensions

Mathematics Subject Classification ID

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

Review text

Let \(G\) be a finite doubly transitive but not triply transitive permutation group acting on a set \(X\). Then the orbit structure of \(G\) on \(X^3=X\times X\times X\) is not the trivial one induced by the symmetric group. The approach of the present paper is to obtain the orbits of \(G\) on \(X^3\) by studying certain combinatorial objects called superschemes (related to the concept of association schemes). As a starting point the orbits of a point stabilizer \(G_\alpha\) on \(X^3\) which define a superscheme are used to create a superscheme of \(G\) on \(X^3\) where \(G\) is considered as a transitive extension of \(G_\alpha\). The algorithm obtained allows for computing the transitive extension \(G\) itself. The algorithm has been implemented and tested successfully for the groups \(G=\text{PSL}(m,q)\) and \(\text{Sp}(2m,2)\), where \(m\geq 3\). The paper contains a short discussion of the superscheme concept in relation to transitive extensions of transitive permutation groups.

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

• 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
• 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?)
• On transitive extensions of finite permutation groups
• Several remarks on transitive extensions of finite permutation groups

Cited in

(9)

• Fast recognition of doubly transitive groups
• Doubly transitive automorphism groups of combinatorial surfaces
• On a class of doubly, but not triply transitive permutation groups
• RETRACTED: Solutions of the equilibrium equations with finite mass subject
• A combinatorial approach to transitive extensions of generously unitransitive permutation groups
• scientific article; zbMATH DE number 3897187 (Why is no real title available?)
• scientific article; zbMATH DE number 645265 (Why is no real title available?)
• scientific article; zbMATH DE number 6438886 (Why is no real title available?)
• A computation of some multiply homogeneous superschemes from transitive permutation groups.

Describes a project that uses

Uses Software

• GAP

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)