A computation of some multiply homogeneous superschemes from transitive permutation groups.

zbMATH Open1158.20300MaRDI QIDQ5301684FDOQ5301684

Authors: Izumi Miyamoto 

Publication date: 20 January 2009

Recommendations

• A combinatorial approach to doubly transitive permutation groups.
• Doubly-transitive permutation groups
• Association schemes, superschemes, and relations invariant under permutation groups
• scientific article; zbMATH DE number 2235050
• A combinatorial approach to transitive extensions of generously unitransitive permutation groups

zbMATH Keywords

algorithmsfinite permutation groupsorbitsassociation schemespoint stabilizerssuperschemesactions on ordered triplesdoubly transitive permutation groupstransitive extensions

Mathematics Subject Classification ID

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

Cited In (2)

• A construction of designs on \(n+1\) points from multiply homogeneous permutation groups of degree \(n\)
• A combinatorial approach to doubly transitive permutation groups.

This page was built for publication: A computation of some multiply homogeneous superschemes from transitive permutation groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301684)