# Posts by Collection

## Snakes: A multiplayer console-based game written in C

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

## Multiplayer Tile Game in Java

A simple multiplayer tile game written in Java and HTML.

## MiniLang: An interpreter written in C++

An interpreter for a simple programming language called MiniLang.

## sHML Parser and Normaliser in Haskell

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

## Two-graphs and NSSDs: An Algebraic Approach

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

## On Walks and Canonical Double Coverings of Graphs with the Same Main Eigenspace

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

## Synthesising Safety Runtime Enforcement Monitors in μHML

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

## On the Walks and Bipartite Double Coverings of Graphs with the same Main Eigenspace

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

## The Ternary Goldbach Conjecture

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: