As a result of the work of the nineteenth-century mathematician Arthur Cayley, algebraists and geometers have extensively studied permutation of sets. In the special case that the underlying set is linearly ordered, there is a natural subgroup to study, namely the set of permutations that preserves
Ordered Groups and Infinite Permutation Groups
β Scribed by V. M. Kopytov, N. Ya. Medvedev (auth.), W. Charles Holland (eds.)
- Publisher
- Springer US
- Year
- 1996
- Tongue
- English
- Leaves
- 252
- Series
- Mathematics and Its Applications 354
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
The subjects of ordered groups and of infinite permutation groups have long enΒ joyed a symbiotic relationship. Although the two subjects come from very different sources, they have in certain ways come together, and each has derived considerable benefit from the other. My own personal contact with this interaction began in 1961. I had done Ph. D. work on sequence convergence in totally ordered groups under the direction of Paul Conrad. In the process, I had encountered "pseudo-convergent" sequences in an ordered group G, which are like Cauchy sequences, except that the differences beΒ tween terms of large index approach not 0 but a convex subgroup G of G. If G is normal, then such sequences are conveniently described as Cauchy sequences in the quotient ordered group GIG. If G is not normal, of course GIG has no group structure, though it is still a totally ordered set. The best that can be said is that the elements of G permute GIG in an order-preserving fashion. In independent investigations around that time, both P. Conrad and P. Cohn had showed that a group admits a total right ordering if and only if the group is a group of automorΒ phisms of a totally ordered set. (In a right ordered group, the order is required to be preserved by all right translations, unlike a (two-sided) ordered group, where both right and left translations must preserve the order.
β¦ Table of Contents
Front Matter....Pages i-viii
Quasivarieties and Varieties of Lattice-Ordered Groups....Pages 1-28
Lattice-ordered Permutation Groups: The Structure Theory....Pages 29-62
On Recovering Structures from Quotients of their Automorphism Groups....Pages 63-95
The Automorphism Groups of Generalized McLain Groups....Pages 97-120
Locally Moving Groups and Reconstruction Problems....Pages 121-157
Infinite Jordan Permutation Groups....Pages 159-194
The Separation Theorem for Group Actions....Pages 195-219
Permutation Groups Whose Subgroups Have Just Finitely Many Orbits....Pages 221-229
Automorphisms of Quotients of Symmetric Groups....Pages 231-247
β¦ Subjects
Group Theory and Generalizations; Order, Lattices, Ordered Algebraic Structures
π SIMILAR VOLUMES
As a result of the work of the nineteenth-century mathematician Arthur Cayley, algebraists and geometers have extensively studied permutation of sets. In the special case that the underlying set is linearly ordered, there is a natural subgroup to study, namely the set of permutations that preserves
Permutation groups are one of the oldest topics in algebra. Their study has recently been revolutionized by new developments, particularly the Classification of Finite Simple Groups, but also relations with logic and combinatorics, and importantly, computer algebra systems have been introduced that