2019-09-30 10:00–11:00 FAMNIT-MP1 Borut Lužar (Fakulteta za informacijske študije v Novem mestu) Between proper and strong edge-colorings In the talk, we will discuss edge-colorings of (sub)cubic graphs. Namely, we will consider edge-colorings in which we work with two types of…
2019-09-04 11:00–12:00 FAMNIT-MP7 Lajos Molnar (University of Szeged, and Budapest University of Technology and Economics, Hungary) Symmetries of structures of positive (semi)definite matrices In this talk we survey the results of our recent research on the 'symmetries' of different structures…
2019-07-23 10:00–11:00 FAMNIT-MP1 Michael Vyalyi (National Research University – Higher School of Economics, Moscow, Russia) Universal trees and parity games Starting from 2017, several quasi-polynomial algorithms for solving parity games were suggested. Using universal ordered trees and automata separation approach…
2019-07-17 10:00–11:00 FAMNIT-MP1 Georgy Sharygin (Yaroslavl Demidov State University, Russia) Combinatoric formula for the Chern classes of triangulated circle bundles In my talk I will describe a construction, which answers the following question: given a triangulation of an oriented principal…
2019-06-10 10:00–11:00 FAMNIT-MP5 Andrés David Santamaría-Galvis (University of Primorska) Shellings from relative shellings, with application to NP-completeness A simplicial complex is shellable if it exhibits a well-behaved ordering of its maximal faces (a shelling) constructed in some precise way.Shellings have been proven useful, but they…
2019-06-05 10:00–11:00 FAMNIT-MP2 Robin Wilson (Open University, United Kingdom) Stamping through Mathematics In this talk I cover the entire history of mathematics in one hour, from earliest times to the modern age, illustrating the narrative with about 300 attractive (and…
2019-06-03 10:00–11:00 FAMNIT-MP1 Žiga Velkavrh (University of Primorska) Reputation and (Dis)honesty: A game-theoretic approach In the first part of this talk we introduce Game Theory, its solution concepts and applications. We then discuss the limits of classical game-theoretic predictions and…
2019-05-27 10:00–11:00 FAMNIT-MP1 Tibor Illés (Budapest University of Technology and Economics, Institute of Mathematics, Hungary) Sufficient linear complementarity problems: matrix classes, algorithms and applications Linear complementarity problems (LCP) generalizes some fundamental problems of mathematical optimization like linear programming (LP) problem,…
2019-05-20 10:00–11:00 FAMNIT-MP1 Daniel Hawtin (University of Rijeka, Croatia) Binary Completely Transitive Codes Given a code in a graph, the vertex set of the graph may be partitioned by the sets of vertices at each of the possible distances to…
2019-05-13 10:00–11:00 FAMNIT-MP1 Nina Chiarelli (FAMNIT and IAM, UP) Linear separation of connected dominating sets in graphs A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. In this talk we present…