Invited speakers
-
Mikhail Volkov (Ural State University)
Exponent sequences of labeled digraph vs reset thresholds of synchronizing automata. - Tero Laihonen (University of Turku)
Identifying codes in graphs: a special class of dominating sets -
Luca Zamboni (Univ. of Lyon and Univ. of Turku)
Ramsey theory and Sturmian partitions. -
Il'ya Ponomarenko (Steklov Institute, St. Petersburg)
Recognizing and isomorphism testing schurian tournaments in polynomial time - Dima Grigoriev (Lille, France)
- Alexander Ivanov (Imperial College London )
Current Progress in Majorana Theory
Complexity of solving tropical linear systems and conjecture on a tropical effective Nullstellensatz.
An algorithm for solving tropical linear systems is designed and its complexity is studied. The classical Nullstellensatz can be treated as a reduction of solvability of a polynomial system to solvability of a linear system with the Cayley matrix. The effective Nullstellensatz reduces solvability to a submatrix of a bounded size. A conjecture on a tropical effective Nullstellensatz is discussed. It holds for univariate tropical polynomials.