suppose a function $\{1,\dots,n\} \to \mathbb r$ has the property that when we take discrete derivatives $k$ times, the result is identically zero. it is fairly well-known that this is equivalent to being a polynomial of degree $k-1$. it's not too unnatural to ask: what does the function look like if, instead, the iterated derivative is required to be zero just a positive proportion of the time? such \emph{approximate polynomials} have a richer structure, related to nilpotent lie groups. on an unrelated note: given an $n \times n$ chessboard, how many ways are there to arrange $n$ queens on it, so that no two attack each other? i'll outline how both these questions are connected to what's known as \emph{higher order fourier analysis}, and explain more generally what higher order fourier analysis is and what it can be used for (other than potentially placing queens on chessboards).