A place for long-form blog posts.
Heuristics for Minimum Euclidean Skeletons
A retrospective look at my 2021 University of Melbourne vacation research project on minimum Euclidean skeletons, a geometric graph theory optimisation problem.
A place for long-form blog posts.
It’d be a bit imprecise to define a measure on the set of open problems, but I’d wager that it is much larger than the set of solved problems.
One such open conjecture is the Hadamard matrix problem, an unsolved problem in mathematics that keeps me up at night. Do square matrices \(H\) with entries \(\pm 1\) satisfying \(HH^T = nI_n\) exist for all \(n = 4k\)? The smallest unknown case is of order 668; like Order 66, but for mathematicians instead of Jedi.
git pathing to make repositories more portable. This is not idiomatic, but it works for adhoc data science projects.