## Page Not Found

Page not found. Your pixels are in another canvas. … *Read more*

A list of all the posts and pages found on the site. For you robots out there is an XML version available for digesting as well.

Page not found. Your pixels are in another canvas. … *Read more*

About me … *Read more*

** Published:**

This is a test blog post. Lorem ipsum dolor sit amet. … *Read more*

A game written in ncurses which communicates with a server using Berkeley sockets.

A simple multiplayer tile game written in Java and HTML.

An interpreter for a simple programming language called MiniLang.

A parser and manipulator of formuae in the safety fragment of the Hennessy-Milner logic which reduces them to normal form, written in Haskell.

Published in *Discrete Applied Mathematics*, 2018

A two-graph $(\mathscr V, \Delta)$ is a combinatorial entity consisting of a set $\mathscr V$ together with a collection $\Delta$ of unordered triples of elements of $\mathscr V$, such that there exists a graph $G$ with vertex set $\mathscr V$ … *Read more*

*Undergraduate dissertation in mathematics*, 2019

The relationship between the main eigenvalues of a graph and the number of walks is discussed. The number of walks $N_k$ of length $k$ is expressed solely in terms of the main eigenvalues … *Read more*

*Undergraduate dissertation in computer science*, 2019

We consider a subset $\text{sHML}$ of formulæ in the Hennessy-Milner Logic with recursion ($\mu\textrm{HML}$) which are enforcable through suppressions … *Read more*

*In press*

The main eigenvalues of a graph $G$ are those eigenvalues of the $(0,1)$-adjacency matrix $\mathbf A$ having a corresponding eigenvector not orthogonal to $\mathbf j=(1,\dots,1)$. The CDC of a graph $G$ is the direct product $G\times K_2$ … *Read more*

*Master's dissertation in mathematics*, 2020

We review Hardy–Littlewood's proof of the ternary Goldbach conjecture for sufficiently large odd numbers which assumes the Generalised Riemann Hypothesis, then discuss Vinogradov's improvement of the minor arcs bound to prove the result unconditionally for $N$ sufficiently large … *Read more*

** Published:**

** Published:**

** Published:**

** Published:**

- Slides [PDF]

** Published:**

- Slides [PDF]

Notes for when I teach music theory and (classical) piano performance

A workshop for doctoral students at the University of Malta

MATSEC Pure and Applied Mathematics

Notes on various topics, mainly to do with mathematics and computer science