MISC

2008年7月

A combinatorial approach to doubly transitive permutation groups

DISCRETE MATHEMATICS
  • Izumi Miyamoto

308
14
開始ページ
3073
終了ページ
3081
記述言語
英語
掲載種別
DOI
10.1016/j.disc.2007.08.032
出版者・発行元
ELSEVIER SCIENCE BV

Let G be a doubly but not triply transitive group on a set X. We give an algorithm to construct the orbits of G acting on X x X x X by combining those of its stabilizer H of a point of X if the group H is given first, we compute the orbits of its transitive extension G, if it exists. We apply our algorithm to G = PSL(m, q) and Sp(2m, 2), m >= 3, successfully. We go forward to compute the transitive extension of G itself. In our construction we use a superscheme defined by the orbits of H on X x X x X and do not use group elements. (c) 2007 Elsevier B.V. All rights reserved.

リンク情報
DOI
https://doi.org/10.1016/j.disc.2007.08.032
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000256239900015&DestApp=WOS_CPL
ID情報
  • DOI : 10.1016/j.disc.2007.08.032
  • ISSN : 0012-365X
  • Web of Science ID : WOS:000256239900015

エクスポート
BibTeX RIS