A reduction theorem for primitive binary permutation groups
A reduction theorem for primitive binary permutation groups
复制标题
本原二元置换群的约简定理
DOI:
10.1112/blms/bdw005
复制
发表时间:
2016
影响因子:
0.9
通讯作者:
Wiscons, Joshua
中科院分区:
文献类型:
--
作者:
Wiscons, Joshua
A permutation groupis said to be binary, or of relational complexity 2, if, for all, the orbits of(acting diagonally) ondetermine the orbits ofonin the following sense: for all,andare-conjugate if and only if every pair of entries fromis-conjugate to the corresponding pair from. Cherlin has conjectured that the only finite primitive binary permutation groups are, groups of prime order, and affine orthogonal groups $V\rtimes O(V),$ whereis a vector space equipped with an anisotropic quadratic form; recently, he succeeded in establishing the conjecture for those groups with an abelian socle. In this note, we show that what remains of the conjecture reduces, via the O'Nan–Scott Theorem, to groups with a nonabelian simple socle.
登录
查看更多内容
影响因子:
0.9
作者:
G. Cherlin
通讯作者:
G. Cherlin
影响因子:
1
作者:
A. Lachlan
通讯作者:
A. Lachlan
DOI:
10.1006/jcta.1996.0050
发表时间:
1996
期刊:
J. Comb. Theory A
影响因子:
--
作者:
G. Cherlin;Gary A. Martin;D. Saracino
通讯作者:
D. Saracino
影响因子:
0.8
作者:
G. Cherlin
通讯作者:
G. Cherlin
DOI:
--
发表时间:
2000
期刊:
Journal of Combinatorial Theory
影响因子:
--
作者:
D. Saracino
通讯作者:
D. Saracino