
Recent Posts
Subscribe to Complex Projective 4Space
Archives
 January 2021
 December 2020
 November 2020
 October 2020
 September 2020
 August 2020
 July 2020
 June 2020
 May 2020
 June 2019
 May 2019
 March 2019
 November 2018
 September 2018
 July 2018
 June 2018
 May 2018
 April 2018
 March 2018
 February 2018
 November 2017
 October 2017
 November 2016
 May 2016
 March 2016
 February 2016
 December 2015
 September 2015
 March 2015
 February 2015
 January 2015
 December 2014
 November 2014
 October 2014
 September 2014
 August 2014
 July 2014
 June 2014
 May 2014
 April 2014
 March 2014
 February 2014
 January 2014
 December 2013
 November 2013
 October 2013
 September 2013
 August 2013
 July 2013
 June 2013
 May 2013
 April 2013
 March 2013
 February 2013
 January 2013
 December 2012
 November 2012
 October 2012
 September 2012
 August 2012
Recent Comments
 Meagre sets and null sets  Complex Projective 4Space on Fat Cantor set
 apgoucher on The neural network of the Stockfish chess engine
 Jeremy Bearimy on The neural network of the Stockfish chess engine
 Johnnycanspell on The neural network of the Stockfish chess engine
 apgoucher on The neural network of the Stockfish chess engine
Category Archives: Uncategorized
Meagre sets and null sets
There are two competing notions for describing a subset of the real numbers as being ‘small’: a null set is a subset of the reals with Lebesgue measure zero; a meagre set is a countable union of nowheredense sets. Both … Continue reading
Posted in Uncategorized
Leave a comment
Rigid heptagon linkage
In January 2000, Erich Friedman considered the problem of finding a rigid unitdistance graph G containing a regular heptagon as a subgraph. That is to say, the graph is immersed in the plane such that: every edge of G must … Continue reading
Posted in Uncategorized
Leave a comment
BarretoNaehrig curves and cryptographic pairings
There’s a very elegant cryptographic construction discovered by Barreto and Naehrig in a 2005 paper. It is beautiful from a pure mathematical perspective, but also has an impressive application: it was* part of the ingenious mechanism by which zCash supports … Continue reading
Posted in Uncategorized
5 Comments
Shallow trees with heavy leaves
There are two very different stateoftheart 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 alphabeta 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
Leave a comment
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
Closedform numbers
Recall that the logarithm function (defined on the punctured complex plane) is multivalued, 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
Leave a comment
The BarnesWall lattices
For any nonnegative integer n, there exists the highly symmetric BarnesWall 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 ndimensional polytope P subsumes a regular ndimensional polytope Q if the vertexset of Q is geometrically similar to a subset of the vertexset of P. For instance, the dodecahedron subsumes a cube (the convex hull … Continue reading
Posted in Uncategorized
1 Comment