Combinatorics Seminar 2017

Speaker: Mikhail V. Volkov (Волков Михаил Владимирович), Ural Federal University

Date: Fri, May 05, 2017

Time: 10:00 - 11:30

Venue: Middle Meeting Room

Title: Černý conjecture, Pin-Frankl's bound and recent advances


We present the proofs of Černý's lower bound and Pin-Frankl's upper bound for the reset threshold of a synchronizing automaton with $n$ states and report on a recent improvement of the latter bound due to Marek Szykuła (Improving the upper bound the length of the shortest reset words)

Slides: View slides