Parallelisms of Complete Designs
Parallelisms of Complete Designs
Peter J. Cameron
March 2011
This ISBN is for an eBook version which is distributed on our behalf by a third party.
Adobe eBook Reader
9780511891847
Looking for an inspection copy?
This title is not currently available for inspection.
$50.00
USDAdobe eBook Reader
GBP
Paperback
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.
Product details
June 1976Paperback
9780521211604
152 pages
229 × 152 × 10 mm
0.234kg
Available
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.
