Nathan Fox

Dr. Fox's research interests lie at the intersection of combinatorics, number theory, and theoretical computer science. Much of his work relates to using computational tools to explore patterns in sequences of integers. He also enjoys games, both studying them with mathematics and playing them. Dr. Fox has broad teaching experience and interests across the mathematics curriculum. His primary goal is for students to take ownership of their learning, underpinned by a philosophy that the best way to learn something is to teach it. This results in a great deal of collaboration in the classroom.

Publications

• "An exploration of solutions to two related Hofstadter-Huber recurrence relations" (with A. Alkan, O. Aybar, and Z. Akdeniz), Chaos, Solitons, & Fractals, Volume 138 (2020).
• "Discovering Linear-Recurrent Solutions to Hofstadter-Like Recurrences Using Symbolic Computation", Journal of Symbolic Computation, Volume 87 (2018), pp. 99-126.
• "A Slow Relative of Hofstadter’s Q-Sequence", Journal of Integer Sequences, Volume 20 (2017).
• "An aperiodic subtraction game of Nim-dimension two" (with U. Larsson), Journal of Integer Sequences, Volume 18 (2015).
• "On the asymptotic abelian complexity of morphic words" (with F. Blanchet-Sadri and N. Rampersad), Advances in Applied Mathematics, Volume 61 (2014).