
Selmer Groups and Hilbert's Tenth Problem
Ari Shnidman, speaking at the Institute for Advanced Study's Members' Colloquium, explains how Selmer groups, a cohomological tool from arithmetic geometry, reduce questions about solutions to diophantine equations to more tractable problems in field and modular arithmetic. He walks through the machinery in down to earth terms before turning to a major application: the recent resolution of Hilbert's Tenth Problem over infinite finitely generated rings, which shows there is no general algorithm for deciding whether a polynomial equation has solutions over such a ring. The talk is pitched at a mixed audience of mathematicians rather than specialists in number theory alone, building intuition for Selmer groups before showing what they buy you. It gives a concrete sense of how a tool developed for elliptic curves and Galois cohomology ends up settling a century old question about computability of equations.