Automorphism groups of compact bordered Klein surfaces
a combinatorial approach
Our rough guess is there are 50,250 words in this book.
At a pace averaging 250 words per minute, this book will take 3 hours and 21 minutes to read. With a half hour per day, this will take 7 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
We earn a commission on purchases
Contributions
- Bujalance García, Emilio. - Contributor
Publication
1990 - Springer-Verlag, Berlin
Language
English
Word Count
50,250 words, Guess
Page Count
201 pages
Identifiers
- Open LibraryOL1857927M
- ISBN-103540529411
- OCLC Control Number22243407
- OCLC Control Numberautomorphismgrou00buja
- Library of Congress Control Number90010189
and 1 more
- Goodreads4145806
Classifications
- DDC510 s
- LCCQA3 .L28 no. 1439
Description
This research monograph provides a self-contained approach to the problem of determining the conditions under which a compact bordered Klein surface S and a finite group G exist, such that G acts as a group of automorphisms in S. The cases dealt with here take G cyclic, abelian, nilpotent or supersoluble and S hyperelliptic or with connected boundary. No advanced knowledge of group theory or hyperbolic geometry is required and three introductory chapters provide as much background as necessary on non-euclidean crystallographic groups. The graduate reader thus finds here an easy access to current research in this area as well as several new results obtained by means of the same unified approach.
Subjects
Series Statement
- Lecture notes in mathematics ;
Other Editions
- Automorphism groups of compact bordered Klein surfaces: a combinatorial approach
Similar Books
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!