An overview of two combinatorial methods
In this series of three lectures, we will discuss two important and relatively new methods in combinatorics. Firstly, the probabilistic method developed by Erdős and which has now seen numerous applications in various areas of mathematics such as number theory, linear algebra, additive combinatorics, real analysis, as well as in computer science. Secondly, we will give an introduction to the polynomial method and present few surprising applications of linear algebra type-arguments to problems in combinatorics and geometry.

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.