Parallelisms of Complete Designs
Part of London Mathematical Society Lecture Note Series
- Author: Peter J. Cameron
- Date Published: March 2011
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
- format: Adobe eBook Reader
- isbn: 9780511891847
Find out more about Cambridge eBooks
Adobe eBook Reader
Other available formats:
Paperback
Looking for an inspection copy?
This title is not currently available on inspection
-
These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. The background material to the theory of parallelisms is introduced and the author then describes the links this theory has with other topics from the whole range of combinatorial theory and permutation groups. These include network flows, perfect codes, Latin squares, block designs and multiply-transitive permutation groups, and long and detailed appendices are provided to serve as introductions to these various subjects. Many of the results are published for the first time.
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: March 2011
- format: Adobe eBook Reader
- isbn: 9780511891847
- availability: This ISBN is for an eBook version which is distributed on our behalf by a third party.
Table of Contents
Introduction
1. The existence theorem
Appendix: the integrity theorem for network flows
2. The parallelogram property
Appendix: the binary perfect code theorem
Appendix: association schemes and metrically regular graphs
3. Steiner points and Veblen points
Appendix: Steiner systems
4. Minimal edge-colourings of complete graphs
Appendix: latin squares, SDRs and permanents
5. Biplanes and metric regularity
Appendix: symmetric designs
6. Automorphism groups
Appendix: multiply transitive groups
7. Resolutions and partition systems
Bibliography
Index.
Related Books
related journals
also by this author
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×