Suchen und Finden

Titel

Autor/Verlag

Inhaltsverzeichnis

Nur eBooks für mein Endgerät anzeigen:

 

Newsletter

The Mathematical Coloring Book - Mathematics of Coloring and the Colorful Life of Its Creators

The Mathematical Coloring Book - Mathematics of Coloring and the Colorful Life of Its Creators

von: Alexander Soifer

Springer-Verlag, 2009

ISBN: 9780387746425, 619 Seiten

Format: PDF, OL

Mac OSX,Windows PC Apple iPad, Android Tablet PC's Online-Lesen für: Linux,Mac OSX,Windows PC

Preis: 56,66 EUR

Mehr zum Inhalt

The Mathematical Coloring Book - Mathematics of Coloring and the Colorful Life of Its Creators


 

To Paint a Bird

6

Foreword

8

Foreword

10

Foreword

12

Acknowledgments

13

Contents

17

Greetings to the Reader

24

Merry-Go-Round

29

A Story of Colored Polygons and Arithmetic Progressions

30

1.1 The Story of Creation

30

1.2 The Problem of Colored Polygons

31

1.3 Translation into the Tongue of APs

33

1.4 Prehistory

34

1.5 Completing the Go-Round

35

Colored Plane

37

Chromatic Number of the Plane: The Problem

38

Chromatic Number of the Plane: An Historical Essay

46

Polychromatic Number of the Plane and Results Near the Lower Bound

57

De Bruijn–Erdös Reduction to Finite Sets and Results Near the Lower Bound

64

Polychromatic Number of the Plane and Results Near the Upper Bound

68

6.1 Stechkin’s 6-Coloring

68

6.2 Best 6-Coloring of the Plane

69

6.3 The Age of Tiling

72

Continuum of 6-Colorings of the Plane

75

Chromatic Number of the Plane in Special Circumstances

82

Measurable Chromatic Number of the Plane

85

9.1 Definitions

85

9.2 Lower Bound for Measurable Chromatic Number of the Plane

85

9.3 Kenneth J. Falconer

90

Coloring in Space

92

Rational Coloring

97

Coloring Graphs

102

Chromatic Number of a Graph

103

12.1 The Basics

103

12.2 Chromatic Number and Girth

106

12.3 Wormald’s Application

110

Dimension of a Graph

112

13.1 Dimension of a Graph

112

13.2 Euclidean Dimension of a Graph

117

Embedding 4-Chromatic Graphs in the Plane

123

14.1 A Brief Overture

123

14.2 Attaching a 3-Cycle to Foundation Points in 3 Balls

125

14.3 Attaching a k-Cycle to a Foundation Set of Type (a1, a2, a3, 0)d

126

14.4 Attaching a k-Cycle to a Foundation Set of Type (a1, a2, a3, 1)d

128

14.5 Attaching a k-Cycle to Foundation Sets of Types (a1, a2, 0, 0)d and (a1, 0, a3, 0)d

128

14.6 Removing Coincidences

130

14.7 O’Donnell’s Embeddings

131

14.8 Appendix

132

Embedding World Records

134

15.1 A 56-Vertex, Girth 4, 4-Chromatic Unit Distance Graph [ Odo1]

135

15.2 A 47-Vertex, Girth 4, 4-Chromatic, Unit Distance Graph [ Chi6]

140

15.3 A 40-Vertex, Girth 4, 4-Chromatic, Unit Distance Graph [ Odo2]

141

15.4 A 23-Vertex, Girth 4, 4-Chromatic, Unit Distance Graph [ HO]

145

15.5 A 45-Vertex, Girth 5, 4-Chromatic, Unit Distance Graph [ HO]

148

Edge Chromatic Number of a Graph

151

16.1 Vizing’s Edge Chromatic Number Theorem

151

16.2 Total Insanity around the Total Chromatic Number Conjecture

159

Carsten Thomassen’s 7-Color Theorem

164

Coloring Maps

169

How the Four-Color ConjectureWas Born

171

18.1 The Problem is Born

171

18.2 A Touch of Historiography

180

18.3 Creator of the 4 CC, Francis Guthrie

182

18.4 The Brother

185

Victorian Comedy of Errors and Colorful Progress

187

19.1 Victorian Comedy of Errors

187

19.2 2-Colorable Maps

189

19.3 3-Colorable Maps

192

19.4 The New Life of the Three-Color Problem

197

Kempe–Heawood’s Five-Color Theorem and Tait’s Equivalence

200

20.1 Kempe’s 1879 Attempted Proof

200

20.2 The Hole

204

20.3 The Counterexample

204

20.4 Kempe–Heawood’s Five-Color Theorem

206

20.5 Tait’s Equivalence

206

20.6 Frederick Guthrie’s Three-Dimensional Generalization

209

The Four-Color Theorem

211

The Great Debate

219

22.1 Thirty Plus Years of Debate

219

22.2 Twenty Years Later, or Another Time – Another Proof

223

22.3 The Future that commenced 65 Years Ago: Hugo Hadwiger’s Conjecture

229

How Does One Color Infinite Maps? A Bagatelle

231

Chromatic Number of the Plane Meets Map Coloring: Townsend – Woodall’s 5- Color Theorem

233

24.1 On Stephen P. Townsend’s 1979 Proof

233

24.2 Proof of Townsend–Woodall’s 5-Color Theorem

235

Colored Graphs

248

Paul Erdös

249

25.1 The First Encounter

250

25.2 Old Snapshots of the Young

252

De Bruijn–Erdös’s Theorem and Its History

258

26.1 De Bruijn–Erdös’s Compactness Theorem

258

26.2 Nicolaas Govert de Bruijn

261

Edge Colored Graphs: Ramsey and Folkman Numbers

264

27.1 Ramsey Numbers

264

27.2 Folkman Numbers

278

The Ramsey Principle

283

From Pigeonhole Principle to Ramsey Principle

284

28.1 Infinite Pigeonhole and Infinite Ramsey Principles

284

28.2 Pigeonhole and Finite Ramsey Principles

288

The Happy End Problem

289

29.1 The Problem

289

29.2 The Story Behind the Problem

293

29.3 Progress on the Happy End Problem

298

29.4 The Happy End Players Leave the Stage as Shakespearian Heroes

301

The Man behind the Theory: Frank Plumpton Ramsey

302

30.1 Frank Plumpton Ramsey and the Origin of the Term “ Ramsey Theory&rdquo

302

30.2 Reflections on Ramsey and Economics, by Harold W. Kuhn

312

Colored Integers: Ramsey Theory Before Ramsey and Its AfterMath

318

Ramsey Theory Before Ramsey: Hilbert’s Theorem

319

Ramsey Theory Before Ramsey: Schur’s Coloring Solution of a Colored Problem and Its Generalizations

321

32.1 Schur’s Masterpiece

321

32.2 Generalized Schur

324

32.3 Non-linear Regular Equations

327

Ramsey Theory before Ramsey: Van der Waerden Tells the Story of Creation

329

Whose Conjecture Did Van derWaerden Prove? Two Lives Between TwoWars: Issai Schur and Pierre Joseph Henry Baudet

340

34.1 Prologue

340

34.2 Issai Schur

341

34.3 Argument for Schur’s Authorship of the Conjecture

350

34.4 Enters Henry Baudet II

354

34.5 Pierre Joseph Henry Baudet

356

34.6 Argument for Baudet’s Authorship of the Conjecture

360

34.7 Epilogue

366

Monochromatic Arithmetic Progressions: Life After Van derWaerden

367

35.1 Generalized Schur

367

35.2 Density and Arithmetic Progressions

368

35.3 Who and When Conjectured What Szemeredi Proved?

370

35.4 Paul Erdös’s Favorite Conjecture

373

35.5 Hillel Furstenberg

376

35.6 Bergelson’s AG Arrays

378

35.7 Van der Waerden’s Numbers

380

35.8 A Japanese Bagatelle

386

In Search of Van der Waerden: The Early Years

387

36.1 Prologue: Why I Had to Undertake the Search for Van derWaerden

387

36.2 The Family

389

36.3 Young Bartel

393

36.4 Van der Waerden at Hamburg

397

36.5 The Story of the Book

400

36.6 Theorem on Monochromatic Arithmetic Progressions

403

36.7 Göttingen and Groningen

405

36.8 Transformations of The Book

406

36.9 Algebraic Revolution That Produced Just One Book

407

36.10 Epilogue: On to Germany

412

In Search of Van der Waerden: The Nazi Leipzig, 1933 – 1945

413

37.1 Prologue

413

37.2 Before the German Occupation of Holland: 1931–1940

414

37.3 Years of the German Occupation of the Netherlands: 1940 – 1945

426

37.4 Epilogue: TheWar Ends

436

In Search of Van der Waerden: The Postwar Amsterdam, 1945166

438

38.1 Breidablik

438

38.2 NewWorld or Old?

441

38.3 Defense

447

38.4 Van der Waerden and Van der Corput: Dialog in Letters

454

38.5 A Rebellion in Brouwer’s Amsterdam

466

In Search of Van der Waerden: The Unsettling Years, 1946 – 1951

469

39.1 The Het Parool Affair

469

39.2 Job History 1945–1947

478

39.3 “America! America!&rdquo

482

39.4 Van der Waerden, Goudsmit and Heisenberg: A ‘Letteral Triangle&rsquo

485

39.5 Professorship at Amsterdam

492

39.6 Escape to Neutrality

494

39.7 Epilogue: The Drama of Van der Waerden

500

Colored Polygons: Euclidean Ramsey Theory

504

Monochromatic Polygons in a 2-Colored Plane

505

3-Colored Plane, 2-Colored Space, and Ramsey Sets

518

Gallai’s Theorem

523

42.1 Tibor Gallai and His Theorem

523

42.2 Double Induction

527

42.3 Proof of Gallai’s Theorem byWitt

527

42.4 Adriano Garsia

532

42.5 An Application of Gallai

534

42.6 Hales-Jewett’s Tic-Tac-Toe

535

Colored Integers in Service of Chromatic Number of the Plane: How O’Donnell Unified Ramsey Theory and No One Noticed

537

Application of Baudet–Schur –Van derWaerden

539

Application of Bergelson–Leibman’s and Mordell – Faltings’ Theorems

543

Solution of an Erdös Problem: O'Donnell's Theorem

547

45.1 O'Donnell's Theorem

547

45.2 Paul O'Donnell

548

Predicting the Future

550

What If We Had No Choice?

551

46.1 Prologue

551

46.2 The Axiom of Choice and its Relatives

553

46.3 The First Example

556

46.4 Examples in the plane

559

46.5 Examples in space

560

46.6 AfterMath & Shelah–Soifer Class of Graphs

562

46.7 An Unit Distance Shelah–Soifer Graph

566

A Glimpse into the Future: Chromatic Number of the Plane, Theorems and Conjectures

569

47.1 Conditional Chromatic Number of the Plane Theorem

569

47.2 Unconditional Chromatic Number of the Plane Theorem

570

47.3 The Conjecture

571

Imagining the Real, Realizing the Imaginary

573

48.1 What Do the Founding Set Theorists Think about the Foundations?

573

48.2 So, What Does It All Mean?

576

48.3 Imagining the Real vs. Realizing the Imaginary

578

Farewell to the Reader

580

Two Celebrated Problems

581

Bibliography

583

Name Index

609

Subject Index

616

Index of Notations

619