Programme of the DIAMANT symposium
Hotel Van der Valk Veenendaal
26 and 27 May 2016
 

 

Thursday  
11:00-11:25 arrival and coffee
11:25-11:30 welcome
Elisa Lorenzo Garcia (UL) Statistics for the number of points on biquadratic curves over finite fields
11:30-12:25
A basic question about a curve over a finite field is how many points it has, and for a family of curves one can study the distribution of this statistic. We will give concrete examples of families in which this distribution is known or predicted, and compute the distribution law for the concrete family of biquadratic curves.
12:30-13:30 lunch
Guus Bollen (TUe) Algebraic matroids and Frobenius flocks
13:30-13:55 In characteristic zero, any algebraic matroid has a linear representation. In positive characteristic, this no longer holds. As an alternative, we introduce the notion of a Frobenius flock. Each algebraic matroid can be represented by a Frobenius flock. Eventually, we want to use Frobenius flocks to help determine whether or not certain matroids are algebraic over certain fields.
Carlo Pagano (UL) Jump sets in local fields
14:00-14:25 We will see how jump sets, easy combinatorial objects, turn out to be very useful when dealing with local fields. We will discuss the following main subjects: (1) The principal units as a filtered module. (2) Jumps of characters. Moreover I will provide hints about how jump sets allow to (a) Predict exact relations between (1) and classical invariants coming from ramification theory. (b) Deduce finer invariants of Eisenstein polynomials, with respect to the ones coming from the Newton polygon of ramification, and have a fast procedure to compute them. (c) Predict a mass formula for (1).
Teresa Piovesan (CWI) Completely positive semidefinite cone
14:30-14:55
We investigate structural properties of the completely positive semidefinite cone, consisting of all the n × n symmetric matrices that admit a Gram representation by positive semidefinite matrices of any size. We will give an overview of the structure of the completely positive semidefinite cone and show how this cone can be used to study problems arising in quantum information theory. Joint work with Sabine Burgdorf and Monique Laurent.
15:00-15:30 tea
Sjabbo Schaveling (UL/UvA) Minimal Models
15:30-15:55 I will review the minimal model construction, a way to construct from representations of the Virasoro algebra a certain class of conformal field theories related to the coset construction on semisimple Lie algebras and the WZW model, as well as the critical Ising model.
Efthymios Sofos (UL) Serre's problem on the density of isotropic fibres in conic bundles
16:00-16:25 Let \pi:X\ --> P^1_Q be a non-singular conic bundle over Q having n non-split fibres and denote by N(\pi,B) the cardinality of the fibres of Weil height at most B that possess a rational point. Serre showed in 1990 that a direct application of the large sieve yields N(\pi,B) << B^2(\log B)^{-n/2} and raised the problem of proving that this is the true order of magnitude of N(\pi,B) under the necessary assumption that there exists at least one smooth fibre with a rational point. We solve this problem for all non-singular conic bundles of rank at most 3. Our method comprises the use of Hooley neutralisers, estimating divisor sums over values of binary forms, and an application of the Rosser-Iwaniec sieve.
Jens Vygen (U Bonn) Approximation Algorithms for Traveling Salesmen
16:30-17:25 For the famous traveling salesman problem (TSP), Christofides’ 1976 algorithm with approximation ratio 3/2 is still the best we know. But recently there has been progress on interesting variants. We will review the state of the art. In particular, we focus on the s-t-path TSP, in which start and end of the tour are given and not identical.
17:30-19.00 drinks
19:00 dinner
   
Friday  
Damaris Schindler (IAS) Systems of quadratic forms
9:00-9:55 In this talk we discuss some aspects concerning the arithmetic of systems of quadratic forms. This includes a result on the frequency of counterexamples to the Hasse principle for del Pezzo surfaces of degree four (joint work with J. Jahnel), and a result on the representability of integers by systems of three quadratic forms (joint work with L. B. Pierce and M. M. Wood).
Ragnar Groot Koerkamp (UU) An algorithm for the stable gonality of finite graphs
10:00-10:25 Last year, Cornelissen et al. defined the stable gonality of finite loopless graphs as an analogon to the gonality of smooth projective curves. A naive way to calculate the stable gonality requires iterating over three infinite sets. Using several new theorems on this new notion of gonality, we come up with a finite algorithm to calculate the stable gonality.
10:30-11:00 coffee
Djordjo Milovic (UL) On the 16-rank of class groups of quadratic number fields, via the negative Pell equation
11:00-11:25 Let CL(D) denote the class group of the quadratic number field of discriminant D. We will briefly explain the link between the negative Pell equation x^2-2py^2 = -1 and the 16-ranks of the class groups CL(8p), CL(-4p), and CL(-8p). We will then give a density result for the 16-rank of CL(-8p) as p ranges over primes congruent to -1 modulo 4. Finally, we discuss progress on a density result for the 16-rank of CL(-4p).
Jan-Willem van Ittersum (UU) An equivariant version of Lehmer's conjecture on heights
11:30-11:55 In 1933, Lehmer conjectured that the Mahler measure of an integer polynomial equals 1 or is bounded away from 1, which is still an open problem. We will discuss an equivariant version of Lehmer's conjecture, formulated in terms of heights. This version has been proved and generalizes bounds on sums of heights by Zagier and Dresden.
Wouter Zomervrucht (FU Berlin/UL) Bhargava's cube law and cohomology
12:00-12:25 In his Disquisitiones Arithmeticae, Gauss describes a composition law on (equivalence classes of) integral binary quadratic forms of fixed discriminant. The resulting group is isomorphic to a quadratic class group. More recently, Bhargava explained Gauss composition as a consequence of a composition law on (equivalence classes of) 2x2x2-cubes of integers. The group structure is again related to class groups. Bhargava's proof is arithmetic. We propose a new proof, obtaining Bhargava's cube law instead from geometry, with class groups arising as flat cohomology.
12:30-13:30 lunch
  special afternoon "Squarefree discriminants"
Manjul Bhargava (Princeton U) Squarefree discriminants I
13:30-14:30 The question as to whether a positive proportion of monic irreducible integer polynomials of degree n have squarefree discriminant is an old one.  (The interest in such polynomials f having squarefree discriminant comes from the fact that in such cases it is immediate to construct the ring of integers in the number field Q[x]/(f(x)), namely, the ring of integers is Z[x]/(f(x)).)  An exact formula for the density was conjectured by Jos Brakenhoff and Hendrik Lenstra.

In this pair of talks, we describe recent joint work with Arul Shankar that allows us to determine the exact probability that a random monic integer polynomial has squarefree discriminant, thus establishing the conjectured density of Brakenhoff and Lenstra.
14:30-15:00 tea
Jerry Wang (Princeton U) Squarefree discriminants II
15:00-16:00 See above.
16:00 end of the symposium
   

 

 



Mathematics cluster DIAMANT

Upcoming events

Diamant symposium
30-11-2017 - 1-12-2017

NMC / Diamant symposium
3-4-2018 - 4-4-2018

News - more news

NWO Call for Tenure Track positions
22-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 Nederland
21-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-grant
12-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.