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
1 - Probabilizing Fibonacci Numbers
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. 1 - 12Publisher: Cambridge University PressPrint publication year: 2018
References
1. , , and Classical and modular approaches to exponential Diophantine equations. I. Fibonacci and Lucas perfect powers. Ann. Math. (2) 163 (2006) 969–1018.CrossRefGoogle Scholar
2. and On the discrepancy of circular sequences of reals. J. Number Theory 164 (2016) 52–65.Google Scholar
4. , and Magical Mathematics: The Mathematical Ideas That Animate Great Magic Tricks. Princeton University Press, Princeton, NJ, 2012.Google Scholar
5. , , and Statistical problems involving permutations with restricted positions. In State of the Art in Probability and Statistics (Leiden, 1999). Vol. 36 of IMS Lecture Notes Monogr. Ser. Inst. Math. Statist., Beachwood, OH, 2001, 195–222.Google Scholar
6. On integers of the form 2k + p and some related problems. Sum. Bras. Math. II (1950) 113–123.Google Scholar
7. A Fibonacci-like sequence of composite numbers. Math. Mag. 37 (1964) 322–324.CrossRefGoogle Scholar
8. , , and Concrete Mathematics: A Foundation for Computer Science, 2nd ed. Addison-Wesley Reading, MA, 1994.Google Scholar
9. Solution of the minimum modulus problem for covering systems. Ann. Math. (2) 181 (2015) 361–382.Google Scholar
10. , , and Rapid mixing of several Markov chains for a hard-core model. In Algorithms and Computation. Vol. 2906 of Lecture Notes in Computer Science, Vol. 2906, 663–675. Springer, Berlin, 2003.Google Scholar
11. The Art of Computer Programming. Vol. 3, 2nd ed. Addison-Wesley, Reading, MA, 1998.
12. Algebras associated to the Young–Fibonacci lattice. Trans. Am. Math. Soc., 346 (1994) 549–568.CrossRefGoogle Scholar
13. Strong theorems on coin tossing. In Proceedings of the International Congress of Mathematicians (Helsinki, 1978). Acad. Sci. Fennica, Helsinki, 749–754, 1980.Google Scholar
15. Enumerative Combinatorics. Vol. 1. Cambridge Studies in Advanced Mathematics, Vol. 49, 2nd ed. Cambridge University Press, Cambridge, 2012.Google Scholar
16. Enumerative Combinatorics. Vol. 2. Cambridge Studies in Advanced Mathematics, Vol. 62. Cambridge University Press, Cambridge, 1999.Google Scholar