Tentative programme of the DIAMANT/EIDMA symposium, 2627 November 2009
Thursday 26 

10:3010:50 
Arrival and coffee  
10:5011:00  Opening  
11:0011:55  Karen Aardal 
Mixedinteger optimization, lattices, and lattice free sets 
(Delft/CWI) 
In mixed integer optimization we maximize a linear function over a polyhedron, with the additional restriction that a subset of the variables are allowed integer values only. We describe how the structure of the underlying lattice can be used to enhance optimization algorithms. We also point to some recent developments in cutting plane theory that naturally lead to the study of lattice free sets.  
12:0012:25 
Arjen Stolk 
Discrete tomography for periodic base sets 
(Leiden) 
Consider an (unknown) finite subset of the integer lattice Z^{2}. Such a shape can be `measured' by taking a straight line through the lattice and counting the number of points of the shape that lie on the line. Suppose these numbers are given for all lines in a finite set of directions, what can one say about the unknown shape? This is the problem of discrete parallel Xrays. Interesting variations of this problem arise by restricting the base set from which the shape is chosen to a subset of Z^{2}. 

12:3013:55  Lunch 

14:0014:25 
Fernando Máriode Oliveira Filho  Exponential density decay in compact rank one symmetric spaces 
(CWI)  Falconer (1986) has shown that if d_{1}, d_{2}, ... is a sequence of distances converging to 0, then the maximum density m(d_{1}, ..., d_{N}) of a subset of R^{n} that does not contain pairs of points at distance d_{1}, ..., d_{N} from each other goes to 0 as N goes to infinity. We show a stronger version of this result for compact rank one symmetric spaces, among which the sphere. More specifically, we show that in these spaces the density decays exponentially with N. (Joint work with Frank Vallentin.) 

14:3014:55 
Gabriele Dalla Torre 
The Tate pairing and number fields 
(Leiden) 
The Tate pairing of curves over finite fields is a nondegenerate paring from a subgroup and a quotient group of the divisor class group onto a quotient group of the multiplicative group of the finite field. The goal of this talk is to study the unitresidue group, which is an obstruction to a similar pairing on number fields. 

15:0015:25  Cecilia Salgado 
Comparing the rank of the generic and the special fibres on rational elliptic surfaces 
(Leiden) 
We prove, for a large class of rational elliptic surfaces, that there are infinitely many fibres with rank at least equal to the generic rank plus two. 

15:3016:00 
Tea break 

16:0016:55 
Vincent Moulton 
A Brief Introduction to Phylogenetic Combinatorics 
(University of East Anglia)  It has now been 150 years since Charles Darwin
presented his theory on the origin of species asserting that all organisms
are related to each other by common descent via a “tree of life”. Since
then, biologists have been able to piece together a great deal of
information concerning this tree – relying in particular in more recent
times on the advent of ever cheaper and faster DNA sequencing
technologies. Even so, there remain many fascinating open problems
concerning the tree of life and the evolutionary processes underlying it,
problems whose solution often require sophisticated techniques from areas
such as mathematics, computerscience and statistics.
Phylogenetic combinatorics can be regarded as a branch of discrete applied mathematics concerned with the combinatorial description and analysis of phylogenetic or evolutionary trees and related mathematical structures such as phylogenetic networks and tight spans. In this talk, we present a brief overview of phylogenetic combinatorics, mentioning some classical as well as some new results and directions in this area. 

Dinner 

Friday 27 

Breakfast  
9:009:55  Marta Casanellas 
Applying algebraic geometry in phylogenetics 
(Universitat Politècnica de Catalunya) 
Many statistical models of evolution can be viewed as algebraic
varieties. As a consequence, algebraic geometry has a lot to do in
phylogenetic reconstruction. Indeed, the generators of the ideal of a
statistical model of evolution should allow to determine the tree formed
by a set of living species.
We will present methods of phylogenetic inference based on algebraic geometry and we will discuss why algebraic geometry should be considered as a powerful tool for phylogenetic reconstruction. We will also see how an indepth study of the geometry of the model leads to major improvements on the methods based on algebraic geometry. 

10:0010:25 
Marco Streng  Igusa class polynomials 
(Leiden) 
Igusa class polynomials are the genus 2 analogue of the classical Hilbert class polynomial. We explain both notions and discuss the differences between the classical (elliptic) case and the genus 2 case, mostly from a computational perspective. 

10:3011:00  Coffee break 

11:0011:25 
Rene Pannekoek 
Parametrizing cubic surfaces and constructing SeveriBrauer surfaces over number fields 
(Leiden) 
Let S/K be a smooth projective cubic surface in P^{3} over a perfect field. First I review a known necessary and sufficient criterion for the existence of a Kbirational map from P^{2} to S. Also, assuming that no birational map exists, I show that a Krational map with degree at most 6 still exists under the condition that S(K) is nonempty and K has cardinality at least 37. This has all been known since the 70s and follows from work by Manin and SwinnertonDyer. Let now S/K be an explicitly given cubic curface as above, and K a number field. I will then show how to verify in practice the existence of a birational map from P^{2} to S. Lastly, I will construct two cubic surfaces over Q which satisfy the said criterion but for the existence of a Qrational point. This comes down to constructing an explicit SeveriBrauer surface over Q, for which I will also outline a method. 

11:3012:25  Ronald Cramer 
Towers of Algebraic Functions Fields in Secure Computation 
Leiden/CWI 
Since the early 1980s towers of algebraic functions fields have played a major role in the theory of error correcting codes. Recently, it has been discovered that towers also have an important bearing on secure multiparty computation. In this talk I will elaborate on this connection.  
12:3013:55  Lunch 

14:0014:25  Filip Cools 
A BrillNoether general graph in every genus 
(Leuven) 
Linear systems on graphs and metric graphs have been introduced by M.
Baker and S. Norine in their paper "RiemannRoch and AbelJacobi theory
on a finite graph", where they show that these systems obey the
counterparts of some wellknown properties for linear systems on
algebraic curves. In "Specialization of linear systems from curves to
graphs", M. Baker conjectures that also the counterpart of the
BrillNoether Theory should hold for linear systems on graphs and metric
graphs.
In my talk, I will give an explicit sequence of BrillNoether general graphs in every genus. This is joint work with J. Draisma, E. Mihaylova Robeva and S. Payne. 

14:3014:55 
Matthias Mnich 
Chromatic Coding and Subexponential Parameterized Complexity 
(Eindhoven) 
We study the probabilistic method of Chromatic Coding for the design of subexponential fixedparameter (FPT) algorithms. This method yields the first subexponential FPTalgorithms for dense parameterized problems such as Feedback Arc Set in Tournaments or Dense Betweenness. Here we consider the Dense Rooted Triplet Inconsistency (Dense RTI) problem which for a dense set R of rooted triplets seeks a distinctly leaflabeled tree that contains subdivisions of all but k triplets in R as subgraph. We derive a kernel for Dense RTI with a quadratic number of labels and a subexponential FPT algorithm with running time O(n^{4} + 2^{O(k^{1/3} log k)}, where n denotes the number of labels appearing in R.  
15:0015:55 
Gerhard Woeginger 
Algorithmic problems under polyhedral norms 
(Eindhoven) 
The talk discusses some algorithmic problems in R^{n} that are hard/intractable if distances are measured according to the Euclidean norm, but become easy/easier if distances are measured according to norms with polyhedral unit balls.  
16:00  Closing 
Back to the conference page.