The abstracts can be found in this file.
The invited lectures will take place in Tabletten (Auditorium F1.101). The contributed talks will take place in Tabletten (Auditorium F1.101) for the blue ones, and in Auditorium U6.A1Aud1 for the green ones. Coffee will be served at Tabletten.
Tuesday | Wednesday | Thursday | |||
9.00 – 10.00 | 9.00 – 10.00 | ||||
Christian Krattenthaler | Sudhir Ghorpade | ||||
Proofs of Borwein Conjectures | Codes, Matroids, Shellability and Betti Numbers | ||||
COFFEE BREAK | |||||
10.30 – 11.00 | 10.30 – 11.00 | ||||
János Barát | Kristina Ago | Vedran Krčadinac | Radu-Cristian Curticapean | ||
Saturated 1-plane and 2-plane drawings with few | On MP-ratio for multiary words: well-definedness and upper bounds | On t-designs with three intersection numbers | The complexity of immanants | ||
11.00 -11.30 | 11.00 -11.30 | ||||
Nima Ghanbari | Michaela Hiller | Sanja Rukavina | Guillermo Nunez Ponasso | ||
Some results on the super domination and co-even domination number of a graph | Domination among Elimination Sequences | On some recent results on biplanes and triplanes | The maximal determinant problem over the third roots of unity | ||
11.30-12.00 | 11.30-12.00 | ||||
Francesc Comellas | Davi Castro-Silva | Andrés David Santamaría-Galvis | Péter Pál Pach | ||
Resilience of hierarchical graphs. | A recursive Lovász theta number for simplex-avoiding sets | Partitioning the projective plane and the dunce hat | The Alon-Jaeger-Tarsi conjecture via group ring identities | ||
LUNCH | |||||
1300-1400 | 13.00-13.30 | ||||
Maria Chudnovsky | Joel Danielsson | Sebastian Debus | |||
Induced Subgraphs and logarithmic tree width | Entropy counting of combinatorial 3-spheres | A bidominance order and Specht ideals for the signed symmetric group | |||
14.15-14.45 | 13.30-14.00 | ||||
Nancy Clarke | Lorenzo Venturello | Marta Pavelka | Sven Polak | ||
Rainbow Dominating Sets | Gorenstein algebras from simplicial complexes | Four non-Hamiltonian simplicial complexes | New lower bounds on crossing numbers of K_{m,n} from permutation modules and semidefinite programming | ||
14.45-15.15 | 14.00-14.30 | ||||
Silvia Pagani | Anna Slivková | Anna Margarethe Limbach | Luis Ferroni | ||
Power sum polynomials and the ghosts behind them | On the existence of m-morphic, σ-morphic and manisohedral tiles for some variations of the notion of tiling | Clique dynamics of locally cyclic graphs with δ ≥ 6 | Ehrhart polynomials, flag Eulerian numbers and algebras of Veronese type | ||
15.15-15.45 | 14.30-15.00 | ||||
Ignacio M. Pelayo | Bojan Bašić | Marija Jelić Milutinović | Pratik Misra | ||
Location in Pseudotrees | The Heesch number in E d is asymptotically unbounded for d → ∞ | Perfect Matching Complexes of Honeycomb Graphs | Symmetrically colored Gaussian graphical models with toric vanishing ideal | ||
COFFEE BREAK | |||||
16.15-16.45 | 15.30-16.00 | ||||
Danai Deligeorgaki | Alexander Lazar | Péter Ágoston | Sara Ban | ||
Unconditional Equivalence for DAG models | Lexicographic Shellability Statistics | Orientation type of intersecting convex planar sets | Self-orthogonal $\mathbb{Z}_{2^k}$-codes constructed from bent functions | ||
16.45-17.15 | 16.00-16.30 | ||||
Klara Stokes | Benjamin Schröter | Eero Räty | Tuomo Lehtilä | ||
Rigidity of rod configurations | On Merino–Welsh conjecture for split matroids | Inequalities on Projected Volumes | New bounds for total dominating identifying codes | ||
17.15-17.45 | 16.30-17.00 | ||||
Zelealem Yilma | Ragnar Freij-Hollanti | Liam Solus | Kristijan Tabak | ||
The minimum number of spanning trees in regular multigraphs | Derived matroids in combinatorics and linear algebra | Discrete Geometry in Causal Structure Learning | Normalized difference sets tiling – generalizations | ||
17.45-18.15 | 17.00-17.30 | ||||
Blas Fernández | Tim Seynnaeve | Harald Gropp | Mrinmoy Datta | ||
CANCELLED | CANCELLED | CANCELLED | CANCELLED | ||
CONFERENCE DINNER |