Cargando…
Ordered permutation groups /
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autor principal: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge [Cambridgeshire] ; New York :
Cambridge University Press,
1981.
|
| Colección: | London Mathematical Society lecture note series ;
55. |
| Temas: | |
| Acceso en línea: | Texto completo |
Tabla de Contenidos:
- CHAPTER 12 ALGEBRAICALLY CLOSED LATTICE-ORDERED GROUPS; CHAPTER 13 THE WORD PROBLEM FOR LATTICE-ORDERED GROUPS; APPENDIX I; APPENDIX II; SOME UNSOLVED PROBLEMS; TEE ABELIAN GROUPABILITY PROBLEM.; ORDERABILITY PROBLEMS.; MULTIPLE TRANSITIVITY PROBLEMS.; TEE PRIMITIVITY PROBLEM.; PROBLEMS ON_ SIMPLICITY AND ^SIMPLICITY.; EXISTENTIALLY CLOSED Z-PERMUTATION GR; THE LATERAL COMPLETION PROBLEM.; WORD PROBLEM TYPE PROBLEMS.; BIBLIOGRAPHY; ANNOTATIONS; INDEX; INDEX OF SYMBOLS