Speaker
Bruno Benedetti
(University of Miami)
Description
The notion of evasiveness lies at the intersection of combinatorics, topology, and theoretical computer science. In 1984 Kahn, Saks, and Sturtevant conjectured that the simplex is the only vertex-transitive simplicial complex that is non-evasive.
In this talk, I will review the history and motivation behind this conjecture and present recent joint work providing a counterexample.
Author
Bruno Benedetti
(University of Miami)