From Hilbert's Tenth Problem to Control Theory
The speaker will be presenting some of the results from his DPhil thesis (2017, University of Oxford). In particular, the talk will be centered on the problem of determining point-to-point reachability for discrete linear time-invariant dynamical systems, when the set of controls is either a convex polyhedron or a finite union of convex polyhedra. The speaker will present a proof that the latter case is undecidable, by encoding Hilbert's Tenth Problem; time permitting, a proof of hardness of the former case will also be presented.

Modular curves are moduli spaces of central importance in arithmetic geometry. In this talk, I will introduce these geometric objects and present some number theoretic results whose proofs used them in an essential way.
After discussing various characterisations and examples, I will explain a comultiplication on these algebras.
a A is representation finite provided there are only finitely many non-isomorphic indecomposable finitely generated A-modules.
look at the approaches to the first case of FLT, by Kummer, Mirimanoff and others.