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
10 - The Haight–Ruzsa Method for Sets with More Differences than Multiple Sums
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. 173 - 186Publisher: Cambridge University PressPrint publication year: 2018
References
1. . Difference covers which have small k-sums for any k. Mathematika 20 (1973), 109–118.Google Scholar
2. and . When almost all sets are difference dominated. Rand om Struct. Algorith. 35, no. 1 (2009), 118–136.Google Scholar
3. . Some explicit constructions of sets with more sums than differences. Acta Arith. 130 (2007), 61–77.Google Scholar
4. , , , and . Generalized more sums than differences sets. J. Number Theory 132, no. 5 (2012), 1054–1073.Google Scholar
5. , , , and . Finding and counting MSTD sets. Combinatorial and additive number theory—CANT 2011 and 2012. Springer Proc. Math. Stat., Vol. 101, Springer, New York, 2014, pp. 79–98.Google Scholar
6. and . Many sets have more sums than differences. Additive combinatorics. CRM Proc. Lecture Notes, Vol. 43, Amer. Math. Soc., Providence, RI, 2007, pp. 287–305.Google Scholar
7. . Problems in additive number theory. I. Additive combinatorics. CRM Proc. Lecture Notes, Vol. 43. Amer. Math. Soc., Providence, RI, 2007, pp. 263–270.Google Scholar
9. . More differences than multiple sums. arXiv: 1601.04146, 2016.