In Summer 2021, I will start the MSc program in Mathematics at McGill University, working on the probabilistic analysis of combinatorial objects under the supervision of Luc Devroye.

### 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.

### Submitted Papers

Papers submitted for publication in refereed journals.

**S1.** (with Anna M. Brandenberger and Luc Devroye) Root estimation in Galton-Watson trees. *arXiv preprint 2007.05681*. Submitted July 2020.

**S2.** (with Rosie Y. Zhao) Arithmetic subsequences in a random ordering of an additive set. *arXiv preprint 2012.12339*. Submitted December 2020.

### Reports

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

**R1.** The OPythn programming language. Software project report, Charles University (Prague, Czech Republic, June 2019), 10 pp.

**R2.** Typechecking proof scripts: making interactive proof assistants robust. Honours project report, McGill University (Montréal, Québec, December 2019), 10 pp.

**R3.** Grid-building algorithms on manifolds. Summer research report, McGill University (Montréal, Québec, August 2020), 10 pp.

### Sequences

I contributed the following sequences to the OEIS:

- A335562: The number of unlabelled unary-binary trees with $n$ nodes such that every node with two children has children of different subtree sizes.
- A338550: The number of binary trees of height $n$ such that the number of nodes at depth $d$ equals $d+1$ for every $d\in {0,\ldots,n}$.
- A338993: Triangle read by rows: $T(n,k)$ is the number of $k$-permutations of \(\{1,\ldots,n\}\) that form a non-trivial arithmetic progression, $1\leq k\leq n$.
- A339941: Triangle read by rows: $T(n,k)$ is the number of permutations of \(\{1,\ldots,n\}\) whose longest embedded arithmetic progression has length $k$.
- A339942: Triangle read by rows: $T(n,k)$ is the number of permutations of the cyclic group \({\bf Z}/n{\bf Z}\) whose longest embedded arithmetic progression has length $k$.
- A341822: The longest known length of a 2-increasing sequence of positive integer triples with entries $\leq n$.