This course is an introduction to linear and discrete optimization.Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems. ...
The theme of the working group varies from year to year. Examples of recent topics studied include: Galois theory of ring spectra, duality in algebra and topology, and topological algebraic geometry. ...
The theme of the working group varies from year to year. Examples of recent topics studied include: Galois theory of ring spectra, duality in algebra and topology, topological algebraic geometry and twisted K-theory ...
The goal of this course is to give an introduction to the theory of distributions and cover the fundamental results of Sobolev spaces including fractional spaces that appear in the interpolation theory. Those notions are central to the study of partial dif ...
A first graduate course in algorithms, this course assumes minimal background, but moves rapidly. The objective is to learn the main techniques of algorithm analysis and design, while building a repertory of basic algorithmic solutions to problems in many ...
This course is an introduction to the theory of Riemann surfaces. Riemann surfaces naturally appear is mathematics in many different ways: as a result of analytic continuation, as quotients of complex domains under discontinuous group actions, as algebraic ...
This course presents the problem of static optimization, with and without (equality and inequality) constraints, both from the theoretical (optimality conditions) and methodological (algorithms) point of view. Economics and financial applications are provi ...
ln this course we will develop algebraic and coalgebraic models for homotopy types.
Among other things we will learn about Quillen's and Sullivan's model of rationâl homotopy types and about Mandell's theorem in p-adic homotopy theory. ...