On this page we maintain a list of mathematical problems considered to be of interest by at least one DIAMANT member. Solutions and new submissions are welcome!

 
Author   Name of the problem (contained in a link)
Rey   Balanced Infinite Designs
Zantema   Matrix inequalities
Draisma   A DIAMANT challenge: complex equiangular lines
de Jeu Sums of negative powers modulo a prime
Shalev Factoring permutations
Shalev Orders of groups generated by t and 1+t
Maubach Polynomial maps over finite fields

 



Mathematics cluster DIAMANT

Upcoming events

News - more news

Call for PhD project proposals
4-11-2019

NWO has issued a cluster-wide call for PhD project proposals. Researchers can apply if they are employed (i.e., hold a salaried position) at a Dutch university or a research institute recognised by NWO, and also have an appointment period for at least the duration of the application procedure and the entire duration of the research for which the grant is being applied for.

Read more.



ERC Starting Grant for Jesper Nederlof
4-11-2019

Jesper Nederlof (TU/e) has been awarded an ERC Starting Grant of almost 1.5 ME. Nederlof will design faster algorithms for hard computational problems in computer science. The grant provides the researcher with the opportunity to further elaborate his own ideas during a period of five years.

Read more.



Full professor position in Discrete Mathematics in Delft
1-11-2018

Delft Institute of Applied mathematics, Delft University of Technology, seeks a full Professor in the field of Discrete Mathematics. A description of the position can be found here. The deadline for applications is January 15, 2019.



ERC Starting grant for Daniel Dadush
26-9-2018

Daniel Dadush (CWI) has been awarded an ERC Starting Grant of 1.5 ME for his proposal ‘Towards a Quantitative Theory of Integer Programming’. With this grant, Dadush aims to revolutionize the understanding of integer programming (IP), the most popular method used today for finding optimal solutions to real-world optimization problems.

Read more.