**Workshop**

Algebra meets combinatorics in Neuchatel

15 - 17 July, 2019, Neuchatel

Algebra meets combinatorics in Neuchatel

15 - 17 July, 2019, Neuchatel

Bruno Benedetti (U of Miami)

Daniel Bernstein (M.I.T.)

Mats Boji (KTH, Stockholm)

Alessio Borzi' (U of Catania)

Alexandru Constantinescu (Freie U Berlin)

Alessio D'Alì (U Warwick)

Carlos D'Andrea (U Barcelona)

Emanuela De Negri (U Genova)

Emanuele Delucchi (U of Fribourg)

Ragnar Freij (Aalto, Helsinki)

Ana Garcia (U Graz)

Hiram Lopez (Cleveland State U)

Martina Juhnke-Kubitzke (U of Osnabrück)

Ralph Morrison (Williams College)

Alberto Ravagnani (U College Dublin)

9:00 - Martina Juhnke-Kubitzke

10:00 - Coffee

10:30 - Emanuele Delucchi

11:30 - Bruno Benedetti

12:30 -

14:00 - Alexandru Constantinescu

15:00 - Emanuela De Negri

9:00 - Hiram Lopez

10:00 - Coffee

10:30 - Alberto Ravagnani

11:30 - Ragnar Freij

12:30 -

14:00 - Carlos D'Andrea

15:00 - Ralph Morrison

9:00 - Mats Boji

10:00 - Coffee

10:30 - Alessio Borzì

11:30 - Alessio D'Alì

12:30 -

14:00 - Daniel Bernstein

15:00 - Ana Garcia

This is at the following address:

You find right below the google maps link:

9:00 - Martina Juhnke-Kubitzke

10:00 - Coffee

10:30 - Emanuele Delucchi

11:30 - Bruno Benedetti

12:30 -

14:00 - Alexandru Constantinescu

15:00 - Emanuela De Negri

The aim of this talk is to present other classes of CS and CS* ideals, in particular binomial edge ideals, multi-graded homogenizations of linear spaces, and multiview ideals. This approach allows us to recover and generalize recent results of various authors.

These results have been obtained jointly with Aldo Conca and Elisa Gorla.

9:00 - Hiram Lopez

10:00 - Coffee

10:30 - Alberto Ravagnani

In this talk, I will first give an introduction to network coding. In particular, I will introduce rank-metric codes as a solution to the issue of error amplification in network transmissions.

The second part of the talk is devoted to mathematical aspects of the theory of error-correcting codes. I will compare rank-metric codes with classical Hamming-metric codes, showing strong divergences in the behaviour of these families with respect to density properties.

In the last part of the talk I will discuss new lines of research intersecting coding theory, combinatorics, and number theory.

11:30 - Ragnar Freij

In the first part of the talk, we will prove lower and upper bounds on the capacity of a coded PIR model with collusion, and show that these converge very quickly as the number of items grows. The proof uses combinations of conditional independence statements between vector spaces and probability spaces.

In the second part of the talk, we define the lift of a linear code over an abstract simplicial complex on the same ground set, to be the smallest code whose projection to any simplex agrees with that of the original code. We show that this is not a matroid invariant, and provide some support for the conjecture that it is matroid invariant for generic codes. Finally, time permitting, we will discuss how to maximize the difference between a code and its lift over a given simplicial complex, in various metrics.

12:30 -

14:00 - Carlos D'Andrea

15:00 - Ralph Morrison

9:00 - Mats Boji

10:00 - Coffee

10:30 - Alessio Borzì

This is a joint work with Ivan Martino.

11:30 - Alessio D'Alì

12:30 -

14:00 - Daniel Bernstein

15:00 - Ana Garcia

You may want to walk:

You cal also take the bus

You may want to walk :) I am kidding :)

You need to take the train. There is a 38 minutes connection every hour.

Here the link to the app.