Notes on nilspaces: algebraic aspects, Discrete Analysis 2017:15, 59 pp. One of the fundamental insights in modern additive combinatorics is that there is a hierarchy of notions of "pseudorandomness" or "higher order Fourier uniformity" that can be applied either to subsets $A$ of an abelian group $G$, or functions $f: G \to {\bf C}$ of that abelian group. For instance, to understand the pseudorandomness of a subset $A$ of an abelian group $G$, one can count the number of parallelograms $$ (x, x+h_1, x+h_2, x+h_1+h_2)$$ that are fully contained in $A$, or (for a higher notion of pseudorandomness) instead count parallelepipeds $ (x, x+h_1, x+h_2, x+h_1+h_2, x+h_3, x+h_1+h_3,$ $x+h_2+h_3, x+h_1+h_2+h_3)$ or even higher-dimensional paralle...