09:0010:00  Masahiko Yoshinaga (Hokkaido University) 
The Euler characteristic reciprocity for order polynomials 
It is well known that the Euler characteristic can be considered as a generalization of the notion of
cardinality of finite sets.
We will apply the above idea to the study of "combinatorial reciprocity", and formulate a reciprocity
at the level of Euler characteristics.
This talk is based on the joint work with Takahiro Hasebe.
(http://arxiv.org/abs/1601.00254)


10:3011:30  Michele d'Adderio (Université Libre de Bruxelles) 
The sandpile model on complete bipartite graphs 
We will dicuss some algorithmic and some enumerative aspects
of the object in the title. The talk has virtually no prerequisites,
so it will be accessible to anybody (also students!) willing to attend. 

13:0013:30  Matthias Lenz (Université de Fribourg) 
A convolution formula for Tutte polynomials of arithmetic matroids and other combinatorial structures 
A lot of combinatorial and topological information about a hyperplane arrangement is captured by the underlying matroid and in particular by its Tutte polynomial. In the 1990s, KookReinerStanton and EtienneLas Vergnas proved a convolution formula for the Tutte polynomial of a matroid. Recently, D'AdderioMoci introduced a combinatorial structure called arithmetic matroid that captures combinatorial and topological information about a toric arrangement, i.e. an arrangement of subtori of codimension one on a torus.
In this talk, we will generalise the convolution formula for the Tutte polynomial to a setting that includes Tutte polynomials of arithmetic matroids, deltamatroids, and polymatroids. As corollaries, we obtain new proofs of two positivity results for pseudoarithmetic matroids, a combinatorial interpretation of the arithmetic Tutte polynomial in terms of arithmetic flows and colourings and a connection with lattice point counting in zonotopes.
This is joint work with Spencer Backman. 

13:4514:15  Pauline Bailet (Universität Bremen) 
Monodromy of the Milnor fiber of sharp arrangements 
In this talk we study the first homology group of the Milnor fiber
of sharp arrangements in the real projective plane (more precisely,
the decomposition into eigenspaces of the monodromy operator).
We describe an algorithm which relies on a minimal complex of the
deconing arrangement and its boundary map, and computes possible
eigenvalues of the monodromy. After some basic recap on
Milnor fiber monodromy and the minimality of the complement,
I will give a criterion to prove amonodronicity. (This is joint work with Simona Settepanella) 

15:1516:30  Sonja Riedel (Universität Bremen / Université de Fribourg) 
Combinatorial Invariants of Toric Arrangements 
Thesis defense 