Members' Colloquium

Selmer groups are a cohomological tool used to reduce the task of finding solutions of certain diophantine equations to easier field and modular arithmetic. I'll explain how this works in down to earth terms and give some concrete applications, including the recent resolution of Hilbert's tenth problem over (infinite) finitely generated rings R. This states that there is no algorithm to determine solubility of polynomial equations over R.