Generative complexity in algebra / [electronic resource] Joel Berman, Pawe� M. Idziak.
Material type:
TextSeries: Memoirs of the American Mathematical Society ; v. 828Publication details: Providence, R.I. : American Mathematical Society, c2005.Description: 1 online resource (vii, 159 p.)ISBN: - 9781470404291 (online)
- 510 s 511.3/3 22
- QA3 .A57 no. 828 QA172.4
E-BOOKS
| Home library | Call number | Materials specified | URL | Status | Date due | Barcode | |
|---|---|---|---|---|---|---|---|
| IMSc Library | Link to resource | Available | EBK13281 |
"Volume 175, number 828 (end of volume)."
Includes bibliographical references (p. 157-159).
1. Introduction 2. Background material Part 1. Introducing generative complexity 3. Definitions and examples 4. Semilattices and lattices 5. Varieties with a large number of models 6. Upper bounds 7. Categorical invariants Part 2. Varieties with few models 8. Types 4 or 5 need not apply 9. Semisimple may apply 10. Permutable may also apply 11. Forcing modular behavior 12. Restricting solvable behavior 13. Varieties with very few models 14. Restricting nilpotent behavior 15. Decomposing finite algebras 16. Restricting affine behavior 17. A characterization theorem Part 3. Conclusions 18. Application to groups and rings 19. Open problems 20. Tables
Access is restricted to licensed institutions
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
Mode of access : World Wide Web
Description based on print version record.
There are no comments on this title.