Video Lectures

We will start with presenting the basic notions of (co)homomology of simplical complexes (which requires only basic linear algebra over the field of order 2) and then we will indicate its relevance for several topics in computer science and...

Solving the following problem is crucial when compiling for a quantum computer: given a finite set $G$ of elements of $SU(2)$, target element $U$ from $SU(2)$ and real number $\epsilon$ find $g_1,\dotsc, g_N$ from $G$ such that $\| g_1 \dotsm g_N -...

We consider questions that arise naturally from the subject of the first talk. The have two main results: 1. In genus $g$, the algebraic degrees of pseudo-Anosov stretch factors include all even numbers between $2$ and $6g - 6$; 2. The Galois...

Many polynomial-time solvable (combinatorial) optimization problems can be reduced to the feasibility problem and the intersection problem. In this talk, I will present the first nearly cubic time algorithm for both problems using a new cutting...