The closure of a lattice-ordered permutation group
Let \(\Omega \) be a chain, \(\overline {\Omega }\) its Dedekind completion, and \((G,\Omega)\) a lattice-ordered permutation group (an \(l\)-permutation group). The authors study some completions of \((G,\Omega)\) in the automorphism group \(A(\overline {\Omega })\). For example, they investigate the gate completion consisting of the elements of \(A(\overline {\Omega })\) which can be gated by elements of \(G\), or equivalently, which respect the tyings of \((G,\Omega)\). The results of the paper illuminate several of the standard completions of abstract completely distributive \(l\)-groups using the structure theory of \(l\)-permutation groups.
- Closures of Finite Primitive Permutation Groups
- scientific article; zbMATH DE number 1254499
- scientific article; zbMATH DE number 278883
- The closed subgroup problem for lattice-ordered groups
- On the 2-Closures of Finite Permutation Groups
- scientific article; zbMATH DE number 4053878
- Publication:3483326
- Cycle-closed permutation groups
- On closures of finite permutation groups
- Structure of k-closures of finite nilpotent permutation groups
- Tyings in lattice-ordered permutation groups
- The closed subgroup problem for lattice-ordered groups
- scientific article; zbMATH DE number 4154504 (Why is no real title available?)
- scientific article; zbMATH DE number 1254499 (Why is no real title available?)
- scientific article; zbMATH DE number 278883 (Why is no real title available?)
This page was built for publication: The closure of a lattice-ordered permutation group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1272115)