A Piece of the Pi: mathematics explained • 66 implied HN points • 31 Jan 26
- You can build a graph by placing n vertices in a cycle and linking them according to the rank order of the first n terms of a real sequence, and as n grows these sequence graphs reveal striking geometric patterns.
- Graphs coming from the Kronecker sequence (multiples of the golden ratio mod 1) can be drawn on a torus without crossings, typically after removing the edge from n−1 to 0.
- Graphs from the van der Corput sequence embed into the Chamanara surface — a highly singular, infinite‑handle (“Loch Ness monster”) surface made by identifying shrinking boundary segments of a square — and finite approximations avoid the worst singularities so they can be visualized.