All Questions

It often happens that if we have a scheme $X/\mathbb Z$ (or an open subset thereof) and we denote by $p(q) = X(\mathbb F_q)$, then $p(1)$ and $p(-1)$ compute the euler characteristic of $X(\mathbb C)$ ...

The number of $k$-simplex elements in an $n$-simplex is counted by the binomial coefficient $\binom{n+1}{k+1}$. For example, the $3$-simplex is the tetrahedron, which has the following elements: $4$ ...