4th SDP days21-3-2013 - 22-3-2013
This a two-days meeting (at CWI Amsterdam) for those who are interested in semidefinite programming and its application to combinatorial optimization, complexity theory, mathematical physics, geometry, and graph theory.
Back to calendar
There will be nine lectures by Per Austrin (KTH, Stockholm), Christine Bachoc (University of Bordeaux), Francois Glineur (Louvain-la-Neuve), Joao Gouveia (Coimbra), Konstantin Makarychev (Microsoft), Markus Schweighofer
(Konstanz), Renata Sotirov (Tilburg), Juan Vera (Tilburg), and Stephanie Wehner (NUS, Singapore). Additionally there will be several lectures by young researchers.
Participation is free. If you like to participate, please send an email to Frank Vallentin before March 8, 2013 so that we can plan the coffee and lunch breaks.
For further information see this URL.
Nikhil Bansal (TU Eindhoven), Monique Laurent (CWI Amsterdam, Tilburg University), Frank Vallentin (TU Delft, CWI Amsterdam)
Mathematics cluster DIAMANT
3 DIAMANT PhD positions awarded19-12-2017
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).
DIAMANT funding continued 19-12-2017
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.
NWO Call for Tenure Track positions22-7-2016
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 25-5-2016
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.