WONDER minicourse on Random Optimization Problems

6-11-2012 - 9-11-2012

The course concerns well-known problems such as finding a minimal-weight matching or a shortest traveling-salesman route, but under the assumption that parameters of the problem such as edge weights are drawn from a probability distribution. This field is currently rapidly developing. It lies in the intersection of probability theory, statistical physics, combinatorial optimization and computer science. The minicourse is primarily intended for Ph.D. students, but others are of course welcome to join. Read more.

Back to calendar

Mathematics cluster DIAMANT

Upcoming events

NMC / Diamant symposium
3-4-2018 - 5-4-2018

News - more news

3 DIAMANT PhD positions awarded

NWO, following a shortlist provided by the DIAMANT board, has decided to award 3 PhD positions to young DIAMANT members: Dion Gijswijt (TU Delft), Jan Steffen Müller (RUG) and Arno Kret (UvA).
Read more.

DIAMANT funding continued

The funding of all four mathematics clusters has been continued by NWO. For the coming two years 85 kE will be available in each cluster.
Read more.

NWO Call for Tenure Track positions

NWO has opened a call for tenure track positions. Proposals for these positions, which include one PhD position for each tenure track position, can be submitted directly to NWO by professors from the 4 mathematics clusters, including Diamant. Diamant professors are warmly encouraged to submit proposals. Read more.

Dion Gijswijt and Jordan Ellenberg independently substantially improve capset bound

A capset in a finite dimensional vector space over the field with 3 elements is a subset that contains no 3-term arithmetic progressions. Dion Gijswijt (TU Delft) and Jordan Ellenberg have independently obtained a bound on the size of a capset that for the first time improves substantially on the trivial bound 3^n. Read more in Terence Tao's blog about these developments.