Aaron Robertson (born November 8, 1971) is an American mathematician who specializes in Ramsey theory. He is a professor at Colgate University.[1]
Aaron Robertson | |
|---|---|
| Born | Aaron Robertson November 8, 1971 Torrance, California, U.S. |
| Alma mater |
|
| Scientific career | |
| Fields | |
| Institutions | Colgate University |
| Thesis | Some New Results in Ramsey Theory (1999) |
| Doctoral advisor | Doron Zeilberger |
Life and education
editAaron Robertson was born in Torrance, California, and moved with his parents to Midland, Michigan at the age of 4. He studied actuarial science as an undergraduate at the University of Michigan, and went on to graduate school in mathematics at Temple University in Philadelphia, where he was supervised by Doron Zeilberger. Robertson received his Ph.D. in 1999 with his thesis titled Some New Results in Ramsey Theory.[2]
Following his Ph.D., Robertson became an assistant professor of mathematics at Colgate University, where he is currently a full professor.
Mathematical work
editRobertson's work in mathematics since 1998 has consisted predominantly of topics related to Ramsey theory.
One of Robertson's earliest publications is a paper, co-authored with his supervisor Doron Zeilberger, which came out of his Ph.D. work. The authors prove that "the minimum number (asymptotically) of monochromatic Schur Triples that a 2-colouring of can have ".[2]
![{\displaystyle [1,n]}](https://wikimedia.org/api/rest_v1/media/math/render/svg/7c79af450e22e8fd23f28e6be4cb23a47b24c1ba)
After completing his dissertation, Robertson worked with 3-term arithmetic progressions where he found the best-known values that were close to each other and titled this piece New Lower Bounds for Some Multicolored Ramsey Numbers.[3]
Another notable piece of Robertson's research is a paper co-authored with Doron Zeilberger and Herbert Wilf titled Permutation Patterns and Continued Fractions.[4] In the paper, they "find a generating function for the number of (132)-avoiding permutations that have a given number of (123) patterns"[4] with the result being "in the form of a continued fraction".[4] Robertson's contribution to this specific paper includes discussion on permutations that avoid a certain pattern but contain others.
A notable paper Robertson wrote titled A Probalistic Threshold For Monochromatic Arithmetic Progressions[5] explores the function (where is fixed) and the r-colourings of . Robertson analyzes the threshold function for -term arithmetic progressions and improves the bounds found previously.
![{\displaystyle [1,n_{k}]=\{1,2,\ldots ,n_{k}\}}](https://wikimedia.org/api/rest_v1/media/math/render/svg/69f9a27c9d5b1593729acd4b8cb80c2f6398fdb8)
In 2004, Robertson and Bruce M. Landman published the book Ramsey Theory on the Integers, of which a second expanded edition appeared in 2014.[6] The book introduced new topics such as rainbow Ramsey theory, an “inequality” version of Schur's theorem, monochromatic solutions of recurrence relations, Ramsey results involving both sums and products, monochromatic sets avoiding certain differences, Ramsey properties for polynomial progressions, generalizations of the Erdős–Ginzberg–Ziv theorem, and the number of arithmetic progressions under arbitrary colourings.
More recently, in 2021, Robertson published a book titled Fundamentals of Ramsey Theory.[7] Robertson's goal in writing this book was to "help give an overview of Ramsey theory from several points of view, adding intuition and detailed proofs as we go, while being, hopefully, a bit gentler than most of the other books on Ramsey theory".[7] Throughout the book, Robertson discusses several theorems including Ramsey's Theorem, Van der Waerden's Theorem, Rado's Theorem, and Hales–Jewett Theorem.
References
edit- ^ "Aaron Robertson | Colgate University". www.colgate.edu. Retrieved 2021-10-17.
- ^ a b Robertson, Aaron; Zeilberger, Doron (1998-03-25). "A 2-Coloring of $[1,N]$ can have $(1/22)N^2+O(N)$ Monochromatic Schur Triples, but not less!". The Electronic Journal of Combinatorics. 5: R19. doi:10.37236/1357. ISSN 1077-8926.
- ^ Robertson, Aaron (1999). "New Lower Bounds for Some Multicolored Ramsey Numbers". The Electronic Journal of Combinatorics. 6: R3. doi:10.37236/1435. ISSN 1077-8926.
- ^ a b c Robertson, Aaron; Wilf, Herbert S.; Zeilberger, Doron (1999-10-01). "Permutation Patterns and Continued Fractions". The Electronic Journal of Combinatorics. 6: R38. doi:10.37236/1470. ISSN 1077-8926.
- ^ Robertson, Aaron (2016-01-01). "A probabilistic threshold for monochromatic arithmetic progressions". Journal of Combinatorial Theory. Series A. 137: 79–87. arXiv:1206.2885. doi:10.1016/j.jcta.2015.08.003. ISSN 0097-3165.
- ^ Landman, Bruce M.; Robertson, Aaron (2014). Ramsey Theory on the Integers. Vol. 73 (2nd ed.). The Student Mathematical Library. doi:10.1090/stml/073. ISBN 978-1-4704-2000-0.
- ^ a b Robertson, Aaron (2021-06-18). Fundamentals of Ramsey Theory. Boca Raton: Chapman and Hall/CRC. doi:10.1201/9780429431418. ISBN 978-0-429-43141-8. S2CID 234866085.
External links
edit