Parallelisms of Complete Designs

Klappentext These notes present an investigation of a condition similar to Euclid's parallel axiom for subsets of finite sets. Zusammenfassung 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. Inhaltsverzeichnis 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.

Product details

• Authors: Peter J. Cameron
• Assisted by: N. J. Hitchin (Editor)
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Paperback / Softback
• Released: 10.06.1976
• EAN: 9780521211604
• ISBN: 978-0-521-21160-4
• No. of pages: 152
• Series: Cambridge Commonwealth Series
• Subject: Natural sciences, medicine, IT, technology > Mathematics > Geometry