A construction of all normal subgroup lattices of 2-transitive automorphism groups of linearly ordered sets

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Total orders (06A05) Ordered groups (06F15) Infinite automorphism groups (20B27) Chains and lattices of subgroups, subnormal subgroups (20E15) Representations of groups as automorphism groups of algebraic systems (20F29)

Review text

An infinite chain (\(\Omega\),\(\leq)\) is called doubly homogeneous, if its automorphism group A(\(\Omega)\) acts 2-transitively on it. A tree (T,\(\leq)\) is a poset with a smallest element such that for each \(a\in T\) the set \(\{\) \(x\in T\); \(x\leq a\}\) is well-ordered. The authors give a complete classification and construction of all normal subgroup lattices N(A(\(\Omega)\)) of the groups A(\(\Omega)\), if (\(\Omega\),\(\leq)\) is a doubly homogeneous chain. They construct to each doubly homogeneous chain \(\Omega\) a pair of trees of a certain type defined independently of (\(\Omega\),\(\leq)\) and to these trees a corresponding lattice, which is shown to be isomorphic to the partially ordered subset of N(A(\(\Omega)\)) consisting of all finitely generated non-trivial subgroups of A(\(\Omega)\). The proof of this result uses a method of the first author [Dissertation, Essen (1982; Zbl 0517.20018)]. Then the authors prove conversely that each tree of the given type can be realized throught a doubly homogeneous chain. Several structure results on N(A(\(\Omega)\)) are also presented.

Recommendations

Cites work

Cited in

(12)

This page was built for publication: A construction of all normal subgroup lattices of 2-transitive automorphism groups of linearly ordered sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086261)