Special afternoon around the abc-conjecture
On Friday November 26 DIAMANT organises a special afternoon around the abc-conjecture
. Invited speakers are David Masser
(Basel), Joseph Oesterlé
(Paris) and Willem-Jan Palenstijn
(Antwerp). The venue is Het Bosgoed
The abc conjecture has originally been formulated in the 1980s by David
Masser and Joseph Oesterlé, two of the three afternoon speakers. It has
a central role in modern number theory. Roughly the conjecture says
that when a, b
are coprime positive integers, and c=a+b
, then the product abc
cannot have, in some precise sense, only a few number of prime factors. The first talk is about the search for triples (a,b,c)
that challenge the abc-conjecture. The second talk discusses an analogue of the abc-conjecture in the polynomial ring over C
. The third talk discusses an analogue of the abc-conjecture in a function field in characteristic p
The programme is as follows:
13.30 - 14.20 Willem-Jan Palenstijn - Enumerating abc-triples
14.30 - 15.30
Joseph Oesterlé - abc over C[t]
15.30 - 16.00 tea
16.00 - 17.00
David Masser - abcd... over Fp(t,u,...)
Participation in this special afternoon is free, but registration is required
. If you are interested in participating, but do not want to register for the whole DIAMANT symposium
(November 25 and 26), please send an email to Robin de Jong (find address here)
before November 19.
Mathematics cluster DIAMANT
Diamant symposium30-11-2017 - 1-12-2017
NMC / Diamant symposium3-4-2018 - 4-4-2018
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.
Harry Buhrman lectures on quantum computing in Universiteit van Nederland21-1-2015
Starting 12 January 2015, the Universiteit van Nederland publishes five public lectures by Harry Buhrman, head of the research group quantum computing at CWI. The series of lectures features the do's and don'ts of the computer of the future. From Monday through Friday, a new lecture will be available on the site of the Universiteit van Nederland each day.
Monique Laurent, Nikhil Bansal and Ronald de Wolf receive TOP-grant12-12-2013
Monique Laurent, Nikhil Bansal and Ronald de Wolf have received a TOP-grant from NWO for their joint project "Approximation Algorithms, Quantum Information and Semidefinite Optimization". Read more.