Muutke küpsiste eelistusi

Difference Sets: Connecting Algebra, Combinatorics, and Geometry [Pehme köide]

  • Formaat: Paperback / softback, 298 pages, kaal: 370 g
  • Sari: Student Mathematical Library
  • Ilmumisaeg: 30-Jul-2013
  • Kirjastus: American Mathematical Society
  • ISBN-10: 0821891766
  • ISBN-13: 9780821891766
Teised raamatud teemal:
  • Formaat: Paperback / softback, 298 pages, kaal: 370 g
  • Sari: Student Mathematical Library
  • Ilmumisaeg: 30-Jul-2013
  • Kirjastus: American Mathematical Society
  • ISBN-10: 0821891766
  • ISBN-13: 9780821891766
Teised raamatud teemal:
Difference sets belong both to group theory and to combinatorics. Studying them requires tools from geometry, number theory, and representation theory. This book lays a foundation for these topics, including a primer on representations and characters of finite groups. It makes the research literature on difference sets accessible to students who have studied linear algebra and abstract algebra, and it prepares them to do their own research. This text is suitable for an undergraduate capstone course, since it illuminates the many links among topics that the students have already studied. To this end, almost every chapter ends with a coda highlighting the main ideas and emphasising mathematical connections.

This book can also be used for self-study by anyone interested in these connections and concrete examples. An abundance of exercises, varying from straightforward to challenging, invites the reader to solve puzzles, construct proofs, and investigate problems - by hand or on a computer. Hints and solutions are provided for selected exercises, and there is an extensive bibliography. The last chapter introduces a number of applications to real-world problems and offers suggestions for further reading. Both authors are experienced teachers who have successfully supervised undergraduate research on difference sets.

Arvustused

This is one among the beautiful books on the subject of difference sets that I came across in the field of mathematics and especially in combinatorics because of its lucid style and simplicity...The present book overviews these subjects if not exhaustively but impressively with required theorems sometimes with full proofs and sometimes with comprehensive explanations and required examples. By the study of this book, one gains an opportunity to further explore the subject with confidence in different angles enriching one's vision for further research with the orientation of applications in the real-life situations as the authors mention such lines as well...This book lays a good foundation for the study of difference sets together with the subjects related to it and prepares the students for further extensive research." - Ratnakaram Nava Mohan, Zentralblatt MATH

"It is a welcome addition to all undergraduate libraries." - CHOICE

"This book would seem tailor-made as a text for a senior seminar or capstone course. It is clearly written, emphasizes motivation, contains lots of examples, has a good bibliography and contains a respectable number of exercises at the end of each chapter. ... Reading this book taught me some nice mathematics that I didn't know before, and it did so in an interesting, enjoyable way." - MAA Reviews

Preface xi
Chapter 1 Introduction
1(10)
Chapter 2 Designs
11(26)
2.1 Incidence structures
11(3)
2.2 t-Designs
14(6)
2.3 Affine planes
20(6)
2.4 Symmetric designs
26(4)
2.5 Projective geometry
30(7)
Chapter 3 Automorphisms of Designs
37(8)
3.1 Group actions
37(3)
3.2 Automorphisms of symmetric designs
40(5)
Chapter 4 Introducing Difference Sets
45(26)
4.1 Definition and examples
46(8)
4.2 Difference sets and designs
54(5)
4.3 Integral group ring
59(6)
4.4 Equivalence
65(6)
Chapter 5 Bruck-Ryser-Chowla Theorem
71(16)
5.1 The BRC Theorem
72(4)
5.2 Proof of BRC for v odd
76(8)
5.3 Partial converse and extension of BRC
84(3)
Chapter 6 Multipliers
87(16)
6.1 Definition and examples
87(4)
6.2 Existence of numerical multipliers
91(3)
6.3 Multipliers fix sD
94(2)
6.4 Using multipliers
96(3)
6.5 Multipliers in non-cyclic groups
99(4)
Chapter 7 Necessary Group Conditions
103(18)
7.1 Intersection numbers
103(9)
7.2 Turyn's exponent bound
112(4)
7.3 Dillon's dihedral trick
116(5)
Chapter 8 Difference Sets from Geometry
121(14)
8.1 Singer difference sets
121(4)
8.2 Turyn's construction
125(4)
8.3 McFarland difference sets
129(6)
Chapter 9 Families from Hadamard Matrices
135(32)
9.1 Hadamard matrices
135(6)
9.2 Paley-Hadamard family: v = 4n - 1
141(14)
9.3 Hadamard family: v = 4n
155(12)
Chapter 10 Representation Theory
167(30)
10.1 Definitions and examples
167(10)
10.2 Equivalent representations
177(2)
10.3 Maschke's Theorem
179(12)
10.4 Representations and difference sets
191(6)
Chapter 11 Group Characters
197(36)
11.1 Definitions and examples
198(3)
11.2 The Fundamental Theorem
201(8)
11.3 Proof of the Fundamental Theorem
209(11)
11.4 Characters and difference sets
220(8)
11.5 Character tables
228(5)
Chapter 12 Using Algebraic Number Theory
233(20)
12.1 Why algebraic number theory?
233(2)
12.2 Definitions and basic facts
235(5)
12.3 Seeking difference sets
240(7)
12.4 Proving Turyn's exponent bound
247(6)
Chapter 13 Applications
253(14)
13.1 Binary sequences
253(4)
13.2 Imaging with coded masks
257(4)
13.3 Error correcting codes
261(2)
13.4 Quantum information and MUBs
263(4)
Appendix A Background 267(6)
Appendix B Notation 273(4)
Appendix C Hints and Solutions to Selected Exercises 277(10)
Bibliography 287(6)
Index 293(4)
Index of Parameters 297
Emily H. Moore, Grinnell College, IA, USA.

Harriet S. Pollatsek, Mount Holyoke College, South Hadley, MA, USA.