## ABOUT ME

I am a PhD student at McGill University under the supervision of Sergey Norin. My research topics are graph theory and combinatorics. My other interests include mathematical analysis, abstract algebra, algorithms and theorical computer science.

I previously completer 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.

##### Talks I'm giving soon.

New bounds on the cop number of abelian Cayley graphs
GRASCan 2021, Online, August 5 2021. |
Abstract |

## RESEARCH

##### Here are some projects I've worked on or am working on at the moment.

Cops and robbers on directed and undirected abelian Cayley graphs (with Peter Bradshaw and Seyyed Aliasghar Hosseini)
European Journal of Combinatorics, forthcoming (accepted 2021). |
Preprint | |

4-cop-win graphs have at least 19 vertices (with Samuel Yvon)
Discrete Applied Mathematics 301C, pp. 74-98, 2021. Data and code complement |
Preprint | Publication |

Cops and robbers on \(2K_2\)-free graphs
Submitted, 2020. |
Preprint | |

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 |

## TEACHING

### Instructor - Université de Montréal

#### Fall 2020

- MAT1680 - Symbolic calculation and applications

### Teaching assistant - Previous semesters

#### Fall 2019

- MAT1680 - Symbolic calculation and applications
- MAT1681 - Computer assisted mathematics

#### Winter 2019

- IFT3545/MAT6490 - Graphs and networks

#### Fall 2018

- MAT1000 - Analysis 1
- MAT1681 - Computer assisted mathematics

#### Winter 2018

- MAT1681 - Computer assisted mathematics

#### Fall 2017

- IFT1065 - Discrete structures in computer science
- MAT1681 - Computer assisted mathematics