Abstract: When can the rows and columns of a non-negative square
matrix be scaled so that it becomes doubly stochastic? In 1964,
Sinkhorn proposed and analyzed a natural iterative procedure that
produces such a scaling when possible. In this talk, we will see this
procedure and see some algorithmic and (if time permits) combinatorial
applications.
Time:
2:30pm-4:00pm
Location:
Room 113
Description:
The h-cobordism theorem -1
Abstract: I will outline a proof of the h-cobordism theorem in these two lectures
Time:
2:30pm-3:30pm
Location:
Room No. 216
Description:
The h-cobordism theorem -1
Abstract: I will outline a proof of the h-cobordism theorem in these two lectures