Mathematics Research

-> Back to home page <-

A height-preserving embedding between two trees

I was a PhD student in mathematics at the University of Oxford under the supervision of Professor Cornelia Druțu. I successfully defended my thesis (On the coarse geometry of solvable Baumslag-Solitar groups and relatively hyperbolic groups) in May 2024.

My field of research was "geometric group theory" which involves applying the techniques and intuition of geometry to problems in algebra and group theory. I was particularly interested in

My papers are written under the name Patrick S. Nairne.

Publications and preprints

Talks

An integer sequence

Imagine that you are about to go for a walk along the number line (a long pebbly beach), beginning at 1 and walking forwards in the positive direction from there. Suppose that you begin with a single pebble in your hand. As you walk, you obey the following rule: each time you pass a power of 2, multiply the amount of pebbles in your possession by 2; each time you pass a power of 3, divide your pebbles evenly into 3 groups and keep only one of the larger groups (e.g. divide 8 pebbles into 3,3,2 and then keep only 3 pebbles). The changing quantity of pebbles in your possession as you walk along the number line forms an integer sequence. The sequence begins

1, 1, 2, 1, 2, 4, 2, 4, 2, 4, 8, 3, 6, 2, 4, 8, 3, 6, 12, 4, ...

The plot belows shows the first 1000 elements of the sequence. For more details you can have a look at my paper Embeddings of Trees, Cantor Sets and Solvable Baumslag-Solitar Groups linked above.

The integer sequence &Chi(2,2,3,3)