Eindhoven: Groups, Algebras and Algorithms

18-3-2010 (thursday)

This is a joint seminar of the research groups
Algebra and Group Theory of Universite Catholique de Louvain
Discrete Algebra and Geometry of Eindhoven University of Technology
Algebra of Ghent University.

This day is sponsered by DIAMANT/NWO and Eidma.

10.00-10.30 Welcome with coffee and tea
10.30-10.40 Opening
10.45-11.30 G. Nebe, Recognizing division algebras
11.45-12.30 A. Caranti, The group generated by the round functions of AES
12.30-13.30 Lunch
13.30-14.15 J. Draisma, Constructing Lie algebras from extremal elements
14.30-15.15 W. Kantor, Recognizing groups of Lie type
15.15-15.20 Closing

The morning session will take place in room AUD10,
the afternoon session in room AUD16
of the Auditorium of the TU Eindhoven.
If you want to join the (free) lunch, please register by sending an email to
For more information, see

Back to calendar

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.