Automorphism Groups of Homogeneous Semilinear Orders: Normal Subgroups and Commutators
Automorphism Groups of Homogeneous Semilinear Orders: Normal Subgroups and Commutators
复制标题
齐次半线性阶的自同构群:正规子群和交换子
DOI:
--
复制
发表时间:
1991
期刊:
影响因子:
--
通讯作者:
H. D. Macpherson
中科院分区:
文献类型:
--
作者:
M. Droste;W. Holland;H. D. Macpherson
A partially ordered set (T, ≤) is called a tree if it is semilinearly ordered, i.e. any two elements have a common lower bound but no two incomparable elements have a common upper bound, and contains an infinite chain and at least two incomparable elements. Let k ∈ ℕ. We say that a partially ordered set (T, ≤) is k-homogeneous, if each isomorphism between two k-element subsets of T extends to an automorphism of (T, ≤), and weakly k-transitive, if for any two k-element subchains of T there exists an automorphism of (T, ≤) taking one to the other.