Permutation Groups and Set-Orbits on the Power Set

被引:1
作者
Yan, Yanxiong [1 ]
Yang, Yong [2 ]
机构
[1] Southwest Univ, Sch Math & Stat, Chongqing 400715, Peoples R China
[2] Texas State Univ, Dept Math, San Marcos, TX 78666 USA
关键词
Finite groups; Orbits; Permutation groups; Power set;
D O I
10.1007/s40840-021-01188-7
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A permutation group G acting on a set Omega induces a permutation group on the power set P(Omega) (the set of all subsets of Omega). Let G be a finite permutation group of degree n and s(G) denote the number of orbits of G on P(Omega). It is an interesting problem to determine the lower bound inf (log(2) s(G)/n) over all groups G that do not contain any alternating group A(l) (where l > t for some fixed t >= 4) as a composition factor. The second author obtained the answer for the case t = 4 in Yang (J Algebra Appl 19:2150005, 2020). In this paper, we continue this investigation and study the cases when t >= 5, and give the explicit lower bounds inf (log(2) s(G)/n) for each positive integer 5 <= t <= 166.
引用
收藏
页码:177 / 199
页数:23
相关论文
共 10 条