-
Recent Posts
Subscribe to Complex Projective 4-Space
Archives
- February 2021
- 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
- Exa on The neural network of the Stockfish chess engine
- Paul on The neural network of the Stockfish chess engine
- Beren on Outer automorphism of S6
- A curious construction of the Mathieu group M11 | Complex Projective 4-Space on Stella octangula
- A curious construction of the Mathieu group M11 | Complex Projective 4-Space on Subsumptions of regular polytopes
Author Archives: apgoucher
A curious construction of the Mathieu group M11
Previously, we discussed which regular polytopes have vertex-sets that occur as proper subsets of the vertex-set of another regular polytope in the same dimension. In particular, when there is a Hadamard matrix of order 4k, then then the (4k−1)-dimensional simplex … Continue reading
Posted in Uncategorized
Leave a comment
Assorted topics
This is a digest of things that have happened this month, but which are individually too small to each warrant a separate cp4space post. Firstly, there have been a couple of exciting results in the field of combinatorics: The Erdős-Faber-Lovász … Continue reading
Posted in Uncategorized
Leave a comment
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 nowhere-dense sets. Both … Continue reading
Posted in Uncategorized
Leave a comment
Keep your public keys private
Yes, the title sounds very counterintuitive. After all, don’t digital signature schemes require the general public to know your public key so that they can verify your signatures? That is correct, but importantly they don’t need to know your public … Continue reading
Posted in Bitcoin
Leave a comment
The neural network of the Stockfish chess engine
Last time, we briefly mentioned the high-level differences between Stockfish and Leela Chess. To recap, Stockfish evaluates about 100 million positions per second using rudimentary heuristics, whereas Leela Chess evaluates 40 000 positions per second using a deep neural network … Continue reading
Posted in Chess
9 Comments
Rigid heptagon linkage
In January 2000, Erich Friedman considered the problem of finding a rigid unit-distance 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
Barreto-Naehrig 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 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
Leave a comment