Author Archives: apgoucher

Shallow trees with heavy leaves

There are two very different state-of-the-art chess engines: Stockfish and Leela Chess Zero. Stockfish searches many more positions (100 000 000 per second) and evaluates them using computationally cheap heuristics. The tree search methodology is a refinement of alpha-beta pruning. … Continue reading

Posted in Uncategorized | 2 Comments

Let the circumcentre be your origin

Suppose we have two vectors, u and v, in a Euclidean vector space. If we wanted to somehow quantify the proximity of these two vectors, there are two particularly appealing choices: the squared distance, |u − v|²; the inner product, … Continue reading

Posted in Uncategorized | Leave a comment

An attempt to understand the Monster group

The Monster group is very large, very complicated, and very mysterious. According to the Classification of Finite Simple Groups that was completed last century, the Monster group is the largest of only 26 finite simple groups that do not fit … Continue reading

Posted in Uncategorized | 3 Comments

The exceptional Jordan algebra

In the early 1930s, Pascual Jordan attempted to formalise the algebraic properties of Hermitian matrices. In particular: Hermitian matrices form a real vector space: we can add and subtract Hermitian matrices, and multiply them by real scalars. That is to … Continue reading

Posted in Uncategorized | Leave a comment

Closed-form numbers

Recall that the logarithm function (defined on the punctured complex plane) is multi-valued, with the different solutions to exp(x) = y differing by integer multiples of 2πi.   James Propp remarked that the values of the form i^i^i are a … Continue reading

Posted in Uncategorized | 1 Comment

The Barnes-Wall lattices

For any nonnegative integer n, there exists the highly symmetric Barnes-Wall lattice in dimension . In low dimensions, these are (up to scaling and rotation) familiar lattices: For n = 0, this is just the integer lattice, . For n … Continue reading

Posted in Uncategorized | 1 Comment

Subsumptions of regular polytopes

We say that a regular n-dimensional polytope P subsumes a regular n-dimensional polytope Q if the vertex-set of Q is geometrically similar to a subset of the vertex-set of P. For instance, the dodecahedron subsumes a cube (the convex hull … Continue reading

Posted in Uncategorized | 2 Comments

Relocation

In June of this year, I read Paul Graham’s essay on names. The author (whom you may know from his book On Lisp) begins with the following advice: If you have a US startup called X and you don’t have … Continue reading

Posted in Uncategorized | Leave a comment

Associative universal gates

The Boolean function NAND is famously universal, in that any Boolean function on n inputs and m outputs can be implemented as a circuit composed entirely of NAND gates. For example, the exclusive-or operation, A XOR B, can be written … Continue reading

Posted in Uncategorized | 3 Comments

Another two rational dodecahedra

Since finding one rational dodecahedron inscribed in the unit sphere, I decided to port the search program to CUDA so that it can run on a GPU and thereby search a larger space in a reasonable amount of time. Firstly, … Continue reading

Posted in Uncategorized | 14 Comments