5 December 2014 Shanfei Li Facility Location Problems: Approximation Algorithms and Polyhedral Results
24 November 2014, UL Ziyang Gao The mixed Ax-Lindemann theorem and its applications to the Zilber-Pink conjecture
16 June 2014, CWI Bart de Keijzer Externalities and Cooperation in Algorithmic Game Theory
4 June 2014, UL Michiel Kosters Groups and fields in arithmetic
26 May 2014, UL Mai Bien On some classes of modules and their endomorphism rings
22 May 2014, UL Willem Jan Palenstijn Radicals in arithmetic
26 February 2014, TUD Henk Post The Shortest Path Problem on Real Road Networks. Theory, Algorithms and Computations
25 November 2013, CWI/TiU
Antonis Varvitsiotis
Combinatorial Conditions for Low Rank Solutions in semidefinite programming
22 November 2013, CWI/UvA Guus Regts Graph parameters and invariants of the orthogonal group
25 October 2013, UL Chao Zhang G-zips and Ekedahl-Oort strata for Hodge type Shimura varieties
24 October 2013, UL Samuele Anni Images of Galois representations
27 September 2013, TUD Frederik von Heymann On Lattice Methods in Integer Optimization
18 September 2013, CWI/UL Wagner Fortes Error bounds for discrete tomography
17 September 2013, UL Rene Pannekoek Topological aspects of rational points on K3 surfaces
4 September 2013, UL Alberto Gioia On the Galois closure of commutative algebras
26 June 2013  , UL Andrea Siviero Class invariants for tame Galois algebras
11 June 2013, UL Ariyan Javan Peykar Arakelov invariants of Belyi curves
10 June, 2013, RUG Afzal Soomro
Algebraic curves over finite fields
27 May, 2013, UU Esther Bod
Algebraic A-hypergeometric functions and their monodromy
8 May 2013, UU Janne Kool
Graphs, Curves and Dynamics
12 April, RUG Peter Dickinson
The copositive cone, the completely positive cone and their generalisations
13 March 2013, TUE Bart Frenk Tropical varieties, maps and gossip
4 February 2013, TUE Maxim Hendriks Platonic maps of low genus
23 January 2013, UT Matthijs Bomhoff Bipartite graphs and the decomposition of systems of equations
18 December 2012, CWI/UL Niek Bouman Cryptography from Quantum Uncertainty, in the Presence of Quantum Side Information
18 December 2012, UL Bas Jansen Mersenne primes and class field theory
20 September 2012, UT Binlong Li Subgraph conditions for Hamiltonian properties of graphs
29 August 2012, TU/e Relinde Jurrius Codes, arrangements, matroids, and their polynomial links.
19 June 2012, CWI/UL Marc Stevens Attacks on hash functions and applications
6 June 2012, TU/e Shoumin Liu Brauer algebras of non-simply laced type
25 April 2012, CWI/UvA David García Soriano Query-Efficient Computation in Property Testing and Learning Theory
23 April 2012, TU/e Ruben Niederhagen Parallel Cryptanalysis
1 February 2012, TU/e Christiaan Eggermont Reachability Problems in Scheduling and Planning
25 January 2012, TU/e Çiçek Güven Özçelebi Buildings and Kneser Graphs
20 December 2011, UL/CWI Erwin Dassen Basis reduction for layered lattices
15 December 2011, TU/e Bruno Pontes Soares Rocha Information flow and declassification analysis for legacy and untrusted programs
27 October 2011, UvA/CWI Jop Briët Grothendieck inequalities, Nonlocal games and Optimization
20 September 2011, UL Birgit van Dalen Discrete tomography with two directions
14 July 2011, TU/e Gaetan Bisson Endomorphism Rings in Cryptography
15 June 2011, UL Arjen Stolk Discrete tomography for integer-valued functions
10 May 2011, TU/e Christiane Peters Curves, codes and cryptography
18 March 2011, TiU Cristian Dobre Semidefinite programming approaches for structured combinatorial optimization problems
24 January 2011, TU/e Peter Schwabe High-speed cryptography and cryptanalysis
22 September 2010, TU/e Matthias Mnich Algorithms in moderately exponential time
1 September 2010, UL Peter J. Bruin  Modular curves, Arakelov theory, algorithmic applications
30 August 2010, UU Jeroen R. Sijsling Equations for arithmetic pointed tori
16 June 2010, UL Ionica Smeets On continued fraction algorithms
1 June 2010, UL T. C. Streng Complex multiplication of abelian surfaces
29 April 2010, TU/e Villegas Bautista, J.A Design of advanced primitives for secure multiparty computation
18 March 2010, TU/e Dan A. Roozemond Algorithms for Lie Algebras of Algebraic Groups
20 January 2010, UL Willemien H. Ekkelkamp On the amount of sieving in factorization methods
22 December 2009, UL Jos F. Brakenhoff Counting problems for number rings
10 December 2009, TU/e J.J.J. van den Broek MIP-based approaches for complex planning problems
1 December 2009, UvA Fernando M. de Oliveira Filho New Bounds for Geometric Packing and Coloring via Harmonic Analysis and Optimization
12 October 2009, TU/e Jos C.H.W. in 't panhuis Lie algebras, extremal elements, and geometries
31 August 2009, TU/e Stefan H.M. van Zwam Partial fields in matroid theory
16 June 2009, UvA Erik Jan van Leeuwen Optimization and approximation on systems of geometric objects
18 May 2009, UU Jakub J. Byszewski Cohomological aspects of equivariant deformation theory
7 May 2009, TU/e Michael Naehrig Constructive and computational aspects of cryptographic pairings
16 April 2009, TU/e Tim Mussche Extremal combinatorics in generalized Kneser graphs
11 March 2009, UL Robbert de Haan  Algebraic techniques for low communication secure protocols
12 February 2009, TU/e Peter Birkner Efficient arithmetic on low-genus curves
29 January 2009, TU/e Leo J.J. van Iersel Algorithms, haplotypes and phylogenetic networks
15 December 2008, UL Johannes G. Bosman Explicit computations with modular Galois representations
27 October 2008, TU/e R. Rezaeian Farashahi Curves and Jacobians: number extractors and efficient arithmetic
17 October 2008, RUG An Khuong Nguyen A modern perspective on Fano's approach to linear differential equations
13 October 2008, TU/e Jaroslaw Byrka Randomized approximation algorithms:facility location, phylogenetic networks, Nash equilibria
26 September 2008, RUG Stephen Meagher Twists of genus three curves and their Jacobians
18 September 2008, UvA F.P. Unger Noise in quantum and classical computation & non-locality
27 August 2008, TU/e Mehmet S. Kiraz Secure and fair two-party computation
26 August 2008, UU Sander R. Dahmen Classical and modular methods applied to Diophantine equations
23 June 2008, RUG Fai Lung Tsai Skew rings, convolutional codes and discrete systems
4 June 2008, UL Theo van den Bogaart Links between cohomology and arithmetic
3 June 2008, UL Sierk W. Rosema Induced substitutions
28 May 2008, UU Oliver Lorscheid Toroidal Automorphic Forms for Function Fields
16 May 2008, RUG Cécile Poirier On geometric Langlands theory and stacks
17 April 2008, TU/e Peter Korteweg Online gathering algorithms for wireless networks
10 April 2008, UvA Nebojsa Gvozdenovic Approximating the stability number and the chromatic number of a graph via semidefinite programming
8 April 2008, TU/e Mohammad Farshi, A theoretical and experimental study of geometric networks
10 March 2008, RUN Ichiro Hasuo Tracing anonymity with coalgebras
1 February 2008 S.D.C. Wehner Cryptography in a quantum world
18 January 2008 Diego Napp Avelli An algebraic approach to multidimensional behaviors
13 November 2007, TU/e Mohammad Ali Abam New data structures and algorithms for mobile data
29 October 2007, TU/e Andrey Sidorenko Design and analysis of provably secure pseudorandom generators
4 October 2007, TU/e Ellen Jochemsz Cryptanalysis of RSA variants using small roots of polynomials
20 June 2007, RUN Iris Loeb  Natural Deduction : Sharing by Presentation
29 May 2007, TUE Michaël W.A. Streppel Multifunctional geometric data structures
8 May 2007, TUE  Erik Postma From Lie algebras to geometry and back
4 May 2007, RUG  Lenny Taelman On t-Motifs
4 May 2007, RUG  Irene Polo-Blanco Theory and history of geometric models
23 February 2007, UvA R.L. Cilibrasi Statistical interference through data compression
31 January 2007, TUE  Vincenzo Bonifaci Models and algorithms for online server routing
19 September 2006, Leiden Kees Joost Batenburg Network flow algorithms for discrete tomography
7 September 2006, UvA  Robert Spalek Quantum algorithms, lower bounds and time-space tradeoffs
27 June 2006, Leiden  Reinier Bröker Constructing elliptic curves of prescribed order
16 May 2006, Leiden  Christian Evert van de Woestijne Deterministic equation solving over finite fields

12 April 2006, TUE

Gábor Maróti Operations Research Models for Railway Rolling Stock Planning
11 January 2006, UvA  T.J. Lee Kolmogorov Complexity and formula size lower bounds

1 November 2005, TUE

Dié Gijsbers BMW Algebras of simply laced type

12 October 2005, TUE

Sergei Haller Computing Galois cohomology and forms of linear algebraic groups

22 September 2005, TUE

Man Nguyen Van Minh Computer-algebraic methods for the construction of designs of experiments

22 September 2005, UvA

Dion Gijswijt Matrix Algebras and Semidefinit Programming Techniques for Codes
8 September 2005, TUE  Scott P. Contini Case studies in symmetric key cryptography
7 September 2005, TUE  Ventzislav Stefanov Nikov Verifiable secret sharing and applications

2 September 2005, Leiden

Gabor Wiese Modular Forms of Weight One Over Finite Fields

17 May 2005, RUN

Mascha Honsbeek Radical extensions and Galois groups


(Here is Mascha with a DIAMANT and a bigger version of the DIAMANT.)


Mathematics cluster DIAMANT

Upcoming events

Diamant symposium
29-11-2018 - 30-11-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.