Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Automorphism groups of totally ordered sets: a retrospective survey

In: Mathematica Slovaca, vol. 61, no. 3
V. V. Bludov - M. Droste - Andrew M. W. Glass

Details:

Year, pages: 2011, 373 - 388
Keywords:
totally ordered set, permutation group, representation, primitive permutation group, amalgamation, free product with amalgamated subgroup, right-orderable group, normal subgroups, Bergman property, outer automorphism groups
About article:
In 1963, W. Charles Holland proved that every lattice-ordered group can be embedded in the lattice-ordered group of all order-preserving permutations of a totally ordered set. In this article we examine the context and proof of this result and survey some of the many consequences of the ideas involved in this important theorem.
How to cite:
ISO 690:
Bludov, V., Droste, M., Glass, A. 2011. Automorphism groups of totally ordered sets: a retrospective survey. In Mathematica Slovaca, vol. 61, no.3, pp. 373-388. 0139-9918. DOI: https://doi.org/10.2478/s12175-011-0018-1

APA:
Bludov, V., Droste, M., Glass, A. (2011). Automorphism groups of totally ordered sets: a retrospective survey. Mathematica Slovaca, 61(3), 373-388. 0139-9918. DOI: https://doi.org/10.2478/s12175-011-0018-1
About edition: