Jérémie Turcotte

PhD student in mathematics, McGill University
Jérémie Turcotte

ABOUT ME

I am a machine learning research scientist at Simmunome Inc.

I have recently defended my PhD thesis at McGill University under the supervision of Sergey Norin, working on various topics in graph theory.

I previously completed a Master's degree in mathematics at Université de Montréal under the supervision of Gena Hahn and Ben Seamone. My Master's research was mainly focused on various aspects of the game of cops and robbers.

RESEARCH

Here are some projects I've worked on or am working on at the moment.
Longest cycles in vertex-transitive and highly connected graphs (with Carla Groenland, Sean Longbrake, Raphael Steiner and Liana Yepremyan)
2024.
Code complement
Preprint
Twin-width of sparse random graphs (with Kevin Hendrey, Sergey Norin and Raphael Steiner)
Submitted, 2023.
Preprint
On an induced version of Menger's theorem (with Kevin Hendrey, Sergey Norin and Raphael Steiner)
Submitted, 2023.
Code complement
Preprint
Limits of degeneracy for colouring graphs with forbidden minors (with Sergey Norin)
Submitted, 2023.
Preprint
Improved bounds on the cop number when forbidding a minor (with Franklin Kenter and Erin Meger)
Submitted, 2023.
Preprint
Finding dense minors using average degree (with Kevin Hendrey, Sergey Norin and Raphael Steiner)
Journal of Graph Theory, 1-19, 2024.
Preprint Publication
The Burning Number Conjecture holds asymptotically (with Sergey Norin)
Journal of Combinatorial Theory, Series B, 168, 208-235, 2024.
Preprint Publication
Cops and robbers on \(P_5\)-free graphs (with Maria Chudnovsky, Sergey Norin and Paul Seymour)
SIAM Journal on Discrete Mathematics, 38(1), 845-856, 2024.
Preprint Publication
Cops and robbers on \(2K_2\)-free graphs
Discrete Mathematics 345(1), 112660, 2022.
Preprint Publication
Cops and robbers on directed and undirected abelian Cayley graphs (with Peter Bradshaw and Seyyed Aliasghar Hosseini)
European Journal of Combinatorics 97, 103383, 2021.
Preprint Publication
4-cop-win graphs have at least 19 vertices (with Samuel Yvon)
Discrete Applied Mathematics 301, pp. 74-98, 2021.
Data and code complement
Preprint Publication
Approximation by random complex polynomials and random rational functions (with Paul M. Gauthier, Thomas Ransford and Simon St-Amant)
Annales Polonici Mathematici 123, pp. 267-294, 2019.
Online pdf Publication

A few of my academic and bibliographic accounts.
Google Scholar dblp ResearchGate ORCID

HOBBIES

When I'm not doing math, I'm usually rock climbing or hiking. Here are a few pictures.
Ten Sleep 1 Ten Sleep 2 Adirondacks Devil's Tower
Ten Sleep 1 Ten Sleep 2 Adirondacks Devil's Tower