Previous Conferences & Workshops

In this talk, we will give explicit examples of Langlands correspondence for reductive groups over the rational function field $F=k(t)$ . Fixing appropriate local ramifications, it is sometimes possible to write down explicit Hecke-eigenforms using...

Semidefinite programming bounds are widely used in combinatorial optimization, quantum computing and complexity theory. The first semidefinite programming bound to gain fame is the so-called theta number developed by Lov\'asz to compute the Shannon...

Recent imaging techniques for acquiring and processing microscopic data, combined with computational models and simulations, are leading to a mechanistic understanding of the development of patterns and forms in plants. This presentation will focus...