ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP
复制标题
论有限排列群的高度和关系复杂性
DOI:
10.1017/nmj.2021.6
复制
发表时间:
2021
影响因子:
0.8
通讯作者:
GILL N
中科院分区:
文献类型:
--
作者:
GILL N
Let G be a permutation group on a set of size t. We say that is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of . We define the height of G to be the maximum size of an independent set, and we denote this quantity . In this paper, we study for the case when G is primitive. Our main result asserts that either or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).
登录
查看更多内容
影响因子:
0.9
作者:
P. Cameron;R. Solomon;A. Turull
通讯作者:
A. Turull
DOI:
10.1017/cbo9780511629259.030
发表时间:
1992
期刊:
--
影响因子:
--
作者:
P. Cameron
通讯作者:
P. Cameron
影响因子:
0.6
作者:
M. Liebeck
通讯作者:
M. Liebeck
DOI:
--
发表时间:
2007
期刊:
影响因子:
--
作者:
Timothy C. Burness
通讯作者:
Timothy C. Burness
DOI:
--
发表时间:
2004
期刊:
影响因子:
--
作者:
M. Quick
通讯作者:
M. Quick