Seminar in Mathematics and Computer Science

The seminar will consist of presentations by visitors and by locals, focusing on various topics in Combinatorics and their applications in Theoretical Computer Science. This is a research seminar, and the program of each week will be sent via email to those interested, and will be posted in this web page.

Schedule (to be updated during the term):

Sunday, starting 10:05, Schreiber building, Room 309.

• February 28: Raphy Yuster (University of Haifa): On the maximum number of spanning copies of an orientation in a tournament
• March 6: Shai Evra (Hebrew University):Topological expanders
• March 13: Asaf Ferber (Yale and MIT): Iterated Log Law for various graph parameters
• March 20: David Conlon (Oxford): Finite reflection groups and graph norms
• March 27: Deepak Rajendraprasad (University of Haifa): Covering a complete simplicial complex with coboundaries
• April 3: Guy Moshkowitz (Tel Aviv University): A sparse regular approximation lemma
• April 10: Penny Haxell (University of Waterloo): Edge Colouring Multigraphs
• April 17,24: Passover
• May 1: Peleg Michaeli (Tel Aviv University): On the trace of random walks on random graphs
• May 8: Mykhaylo Tyomkyn (Tel Aviv University): Approximate edge-decompositions and the Blow-up lemma
• May 15: Noam Solomon (Tel Aviv University): Distinct and repeated distances on a surface in R^3
• May 22: Eoin Long (Tel Aviv University): Forbidden vector-valued intersections
• May 29: Rani Hod (Tel Aviv University and Bar Ilan University): (k,ell)-suitable digraphs
• June 5: IMU meeting, Dead Sea

Link to Google calendar of the seminar

Seminar homepage for the fall semester, 2015