- Authors:
- Martin Aigner,
- Gnter M. Ziegler
From the Reviews: "... Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. Some of the proofs are classics, but many are new and brilliant proofs of classical results. ...Aigner and Ziegler... write: "... all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ... " Notices of the AMS, August 1999 "... the style is clear and entertaining, the level is close to elementary ... and the proofs are brilliant. ..." LMS Newsletter, January 1999 This third edition offers two new chapters,on partition identities, and on card shuffling. Three proofs of Euler's most famous infinite series appear in a separate chapter. There is also a number of other improvements, such as an exciting new way to "enumerate the rationals".
Cited By
Nakajima T and Živný S (2024). On the Complexity of Symmetric vs. Functional PCSPs, ACM Transactions on Algorithms, 20:4, (1-29), Online publication date: 31-Oct-2024.- Caldarola F, d’Atri G and Pellegrini M Combinatorics on n-sets: Arithmetic Properties and Numerical Results Numerical Computations: Theory and Algorithms, (389-401)
- Iwata S and Yokoi Y (2018). List Supermodular Coloring, Combinatorica, 38:6, (1437-1456), Online publication date: 1-Dec-2018.
- Cohen G, Haeupler B and Schulman L Explicit binary tree codes with polylogarithmic size alphabet Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (535-544)
- Larson C and Van Cleemput N Automated conjecturing I Proceedings of the 26th International Joint Conference on Artificial Intelligence, (5015-5019)
- Dvořák P, Eiben E, Ganian R, Knop D and Ordyniak S Solving integer linear programs with a small number of global variables and constraints Proceedings of the 26th International Joint Conference on Artificial Intelligence, (607-613)
- Panagiotou K and Speidel L (2017). Asynchronous Rumor Spreading on Random Graphs, Algorithmica, 78:3, (968-989), Online publication date: 1-Jul-2017.
- Januario T, Urrutia S and de Werra D (2016). Sports scheduling search space connectivity, Discrete Applied Mathematics, 211:C, (113-120), Online publication date: 1-Oct-2016.
- Govindarajan S and Nivasch G (2015). A Variant of the Hadwiger---Debrunner (p, q)-Problem in the Plane, Discrete & Computational Geometry, 54:3, (637-646), Online publication date: 1-Oct-2015.
- Mostéfaoui A, Moumen H and Raynal M (2015). Signature-Free Asynchronous Binary Byzantine Consensus with t < n/3, O(n2) Messages, and O(1) Expected Time, Journal of the ACM, 62:4, (1-21), Online publication date: 11-Sep-2015.
- Bouzid Z, Mostfaoui A and Raynal M Minimal Synchrony for Byzantine Consensus Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, (461-470)
- Ackerman E and Schaefer M A Crossing Lemma for the Pair-Crossing Number Revised Selected Papers of the 22nd International Symposium on Graph Drawing - Volume 8871, (222-233)
- Mostefaoui A, Moumen H and Raynal M Signature-free asynchronous byzantine consensus with t < n/3 and o(n2) messages Proceedings of the 2014 ACM symposium on Principles of distributed computing, (2-9)
- Van Dam E and Omidi G (2013). Strongly walk-regular graphs, Journal of Combinatorial Theory Series A, 120:4, (803-810), Online publication date: 1-May-2013.
- Boothby T The density of ternary barker sequences Proceedings of the 7th international conference on Sequences and Their Applications, (315-326)
- Jiang D and Nipkow T Proof pearl Proceedings of the First international conference on Certified Programs and Proofs, (394-399)
- Bjørner N, Blass A and Gurevich Y (2010). Content-dependent chunking for differential compression, the local maximum approach, Journal of Computer and System Sciences, 76:3-4, (154-203), Online publication date: 1-May-2010.
- Maehara H (2010). On a sphere that passes through n lattice points, European Journal of Combinatorics, 31:2, (617-621), Online publication date: 1-Feb-2010.
- Björklund M and Engström A (2009). The g-theorem matrices are totally nonnegative, Journal of Combinatorial Theory Series A, 116:3, (730-732), Online publication date: 1-Apr-2009.
- Calamoneri T, Fusco E, Shende A and Shende S Proxy assignments for filling gaps in wireless ad-hoc lattice computers Proceedings of the 14th international conference on Structural information and communication complexity, (208-221)
- Pach J, Pinchasi R and Sharir M A tight bound for the number of different directions in three dimensions Proceedings of the nineteenth annual symposium on Computational geometry, (106-113)