Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- 1 Probabilizing Fibonacci Numbers
- 2 On the Number of ON Cells in Cellular Automata
- 3 Search for Ultraflat Polynomials with Plus and Minus One Coefficients
- 4 Generalized Gončarov Polynomials
- 5 The Digraph Drop Polynomial
- 6 Unramified Graph Covers of Finite Degree
- 7 The First Function and Its Iterates
- 8 Erdős, Klarner, and the 3x + 1 Problem
- 9 A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
- 10 The Haight–Ruzsa Method for Sets with More Differences than Multiple Sums
- 11 Dimension and Cut Vertices: An Application of Ramsey Theory
- 12 Recent Results on Partition Regularity of Infinite Matrices
- 13 Some Remarks on π
- 14 Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
- 15 Borsuk and Ramsey Type Questions in Euclidean Space
- 16 Pick's Theorem and Sums of Lattice Points
- 17 Apollonian Ring Packings
- 18 Juggling and Card Shuffling Meet Mathematical Fonts
- 19 Randomly Juggling Backwards
- 20 Explicit Error Bounds for Lattice Edgeworth Expansions
- References
13 - Some Remarks on π
Published online by Cambridge University Press: 25 May 2018
Book contents
- Frontmatter
- Contents
- List of Contributors
- Preface
- 1 Probabilizing Fibonacci Numbers
- 2 On the Number of ON Cells in Cellular Automata
- 3 Search for Ultraflat Polynomials with Plus and Minus One Coefficients
- 4 Generalized Gončarov Polynomials
- 5 The Digraph Drop Polynomial
- 6 Unramified Graph Covers of Finite Degree
- 7 The First Function and Its Iterates
- 8 Erdős, Klarner, and the 3x + 1 Problem
- 9 A Short Proof for an Extension of the Erdős–Ko–Rado Theorem
- 10 The Haight–Ruzsa Method for Sets with More Differences than Multiple Sums
- 11 Dimension and Cut Vertices: An Application of Ramsey Theory
- 12 Recent Results on Partition Regularity of Infinite Matrices
- 13 Some Remarks on π
- 14 Ramsey Classes with Closure Operations (Selected Combinatorial Applications)
- 15 Borsuk and Ramsey Type Questions in Euclidean Space
- 16 Pick's Theorem and Sums of Lattice Points
- 17 Apollonian Ring Packings
- 18 Juggling and Card Shuffling Meet Mathematical Fonts
- 19 Randomly Juggling Backwards
- 20 Explicit Error Bounds for Lattice Edgeworth Expansions
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Connections in Discrete MathematicsA Celebration of the Work of Ron Graham, pp. 214 - 239Publisher: Cambridge University PressPrint publication year: 2018
References
1. and . Edge-colored complete graphs with precisely colored subgraphs. Combinatorica 3, no. 3–4, (1983), 315–324.Google Scholar
2. . Problems and results on graphs and hypergraphs: Similarities and differences. Mathematics of Ramsey theory. Algorithms Combin., Vol. 5, Springer, Berlin, 1990, pp. 12–28.Google Scholar
3. and . On Ramsey-Turan type theorems for hypergraphs. Combinatorica 2, no. 3 (1982), 289–295.Google Scholar
4. and . Extremal problems on set systems. Rand om Struct. Algorithms 20 (2002), no. 2, 131–164.Google Scholar
5. , , and . A problem of Erdős and Sos on 3-graphs. Israel J. Math. 211, no. 1 (2016), 349–366.Google Scholar
6. . Quasirand omness, counting and regularity for 3-uniform hypergraphs. Combin. Probab. Comput. 15, no. 1–2 (2006), 143–184.Google Scholar
7. , , , and . Hypergraph regularity and quasirand omness. Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 2009, pp. 227–235.Google Scholar
8. Chr. Reiher, , and . On a Turan problem in weakly quasirand om 3-uniform hypergraphs. Available at arXiv:1602.02290. Submitted.
9. Chr. Reiher, , and . Embedding tetrahedra into quasirand om hypergraphs. J. Combin. Theory Ser. B 121 (2016), 229–247.Google Scholar
10. and . Regular partitions of hypergraphs: Regularity lemmas. Combin. Probab. Comput. 16, no. 6 (2007), 833–885.Google Scholar
11. and . Regular partitions of hypergraphs: counting lemmas. Combin. Probab. Comput. 16, no. 6 (2007), 887–901.Google Scholar
12. . Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48 (1941), 436–452 (Hungarian, with German summary).Google Scholar
- 5
- Cited by