Freshly Printed - allow 6 days lead
Connections in Discrete Mathematics
A Celebration of the Work of Ron Graham
Many of the best researchers and writers in discrete mathematics come together in a volume inspired by Ron Graham.
Steve Butler (Edited by), Joshua Cooper (Edited by), Glenn Hurlbert (Edited by)
9781107153981, Cambridge University Press
Hardback, published 14 June 2018
432 pages
23.5 x 15.7 x 2.3 cm, 0.62 kg
'Two features of the book contribute to making it reader-friendly: its layout, which is very comfortable to read, and the numerous examples that are peppered throughout the chapters.' S. Collier Coutinho, The Mathematical Gazette
Discrete mathematics has been rising in prominence in the past fifty years, both as a tool with practical applications and as a source of new and interesting mathematics. The topics in discrete mathematics have become so well developed that it is easy to forget that common threads connect the different areas, and it is through discovering and using these connections that progress is often made. For over fifty years, Ron Graham has been able to illuminate some of these connections and has helped to bring the field of discrete mathematics to where it is today. To celebrate his contribution, this volume brings together many of the best researchers working in discrete mathematics, including Fan Chung, Erik D. Demaine, Persi Diaconis, Peter Frankl, Alfred W. Hales, Jeffrey C. Lagarias, Allen Knutson, Janos Pach, Carl Pomerance, N. J. A. Sloane, and of course, Ron Graham himself.
1. Probabilizing Fibonacci numbers Persi Diaconis
2. On the number of ON cells in cellular automata N. J. A. Sloane
3. Search for ultraflat polynomials with plus and minus one coefficients Andrew Odlyzko
4. Generalized Goncharov polynomials Rudolph Lorenz, Salvatore Tringall and Catherine H. Yan
5. The digraph drop polynomial Fan Chung and Ron Graham
6. Unramified graph covers of finite degree Hau-Wen Huang and Wen-Ching Winnie Li
7. The first function and its iterates Carl Pomerance
8. Erdos, Klarner, and the 3x + 1 problem Jeffrey C. Lagarias
9. A short proof for an extension of the Erdos–Ko–Rado theorem Peter Frankl and Andrey Kupavskii
10. The Haight–Ruzsa method for sets with more differences than multiple sums Melvyn B. Nathanson
11. Dimension and cut vertices William T. Trotter, Bartosz Walczak and Ruidong Wang
12. Recent results on partition regularity of infinite matrices Neil Hindman
13. Some remarks on pi Christian Reiher, Vojtech Rodl and Mathias Schacht
14. Ramsey classes with closure operations Jan Hubicka and Jaroslav Nesetril
15. Borsuk and Ramsey type questions in Euclidean space Peter Frankl, Janos Pach, Christian Reiher and Vojtech Rodl
16. Pick's theorem and sums of lattice points Karl Levy and Melvyn B. Nathanson
17. Apollonian ring packings Adrian Bolt, Steve Butler and Espen Hovland
18. Juggling and card shuffling meet mathematical fonts Erik D. Demaine and Martin L. Demaine
19. Randomly juggling backwards Allen Knutson
20. Explicit error bounds for lattice Edgeworth expansions J. P. Buhler, A. C. Gamst, Ron Graham and Alfred W. Hales.
Subject Areas: History of mathematics [PBX], Combinatorics & graph theory [PBV], Number theory [PBH], Discrete mathematics [PBD]