My research interests include:


Research articles published in peer-reviewed journals, in reverse order of acceptance (and not necessarily appearance).

P6. (with Jonah Saks) On the homology of several number-theoretic set families. Enumerative Combinatorics and Applications 4,2 (2024), #S2R12, 11 pp. [arXiv]
P5. (with Jad Hamdan and Jonah Saks) The lattice of arithmetic progressions. Australasian Journal of Combinatorics 84,3 (2022), 357–374. [arXiv]
P4. (with Luc Devroye and Rosie Y. Zhao) On the peel number and the leaf-height of a Galton-Watson tree. Combinatorics, Probability and Computing 32,1 (2023), 68–90. [arXiv]
P3. (with Anna M. Brandenberger, Luc Devroye, and Rosie Y. Zhao) Leaf multiplicity in a Bienaymé-Galton-Watson tree. Discrete Mathematics and Theoretical Computer Science 24,1 (2022), #7, 16 pp. [arXiv]
P2. (with Anna M. Brandenberger and Luc Devroye) Root estimation in Galton-Watson trees. Random Structures and Algorithms 61,3 (2022), 520–542. [arXiv]
P1. (with Rosie Y. Zhao) Arithmetic subsequences in a random ordering of an additive set. Integers: Electronic Journal of Combinatorial Number Theory 21 (2021), #A89, 19 pp. [arXiv]

For recent preprints and unpublished manuscripts, consult the full list of my articles on arXiv, or my Google Scholar profile.

Reports and theses

Various project and research reports. Some reports were written for internal distribution only, and are therefore not available for download.

R5. Structural properties of conditional Galton-Watson trees. M.Sc. thesis, McGill University (Montréal, Québec, August 2022), vi + 75 pp.
R4. Finding regularity in Tlingit verb prefixes. Semester project report, McGill University (Montréal, Québec, April 2021), 7 pp.
R3. Grid-building algorithms on manifolds. Summer research report, McGill University (Montréal, Québec, August 2020), 10 pp.
R2. Typechecking proof scripts: making interactive proof assistants robust. Honours project report, McGill University (Montréal, Québec, December 2019), 10 pp.
R1. The OPythn programming language. Software project report, Charles University (Prague, Czech Republic, June 2019), 10 pp.


I contributed the following sequences to the OEIS:

Galton–Watson trees

For my M.Sc., I worked on the probabilistic analysis of combinatorial objects under the supervision of Luc Devroye. In particular, we focused our attention on Galton–Watson trees and various structural parameters thereof. I graduated in August 2022 with a thesis entitled Structural properties of conditional Galton-Watson trees.

Summer 2020

I received an NSERC Undergraduate Summer Research Award for Summer 2020. I worked with Asa Kohn under the supervision of Michael Lipnowski, designing and implementing sorting algorithms on manifolds with the goal of efficiently building grids on these spaces.

COMP 400 Honours Project in Computer Science

During the Fall 2019 semester, I undertook a project in the Computation and Logic lab under the supervision of Brigitte Pientka. I worked with Jacob Errington to develop a typechecking algorithm for the Harpoon proof language as well as a translation procedure to convert Harpoon proof scripts into programs in the Beluga programming language. The summary of the work I helped with can be found in the slides to my end-of-term presentation, and my full report is available for download as well.