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):

• March 19: Amir Yehudayoff (Technion): An exposition to topological overlap in the plane
• March 26: Mykhaylo Tyomkyn (Tel Aviv University): Lagrangians of hypergraphs: The Frankl-Furedi conjecture holds almost everywhere
• April 2: Amir Ban (Tel Aviv University): Decomposing Weighted Graphs
• April 9,16: Passover
• April 23: Eli Berger (University of Haifa): Fair representation
• April 30: Rom Pinchasi (Technion):On the Sylvester Graph of points in the plane
• May 7: Peter L. Erdos (Budapest):Terminal-Pairability in Complete Bipartite Graphs
• May 14: Nadav Sherman (Tel Aviv University):Induced Universal Hypergraphs
• May 21: Peter Horak (U. of Washington, Tacoma):Tiling Z^n by Translates
• May 28: IMU meeting, Akko
• June 4: Guy Moshkovitz (Tel Aviv University):A tight bound for hypergraph regularity
• June 11: Ehud Friedgut (Weizmann Institute):Almost-intersecting families are almost intersecting-families
• June 18: Paul Smith (Tel Aviv University):Uncomputability in bootstrap percolation
• June 25: Rani Hod (Bar-Ilan University):Optimal backup strategies against cyber attacks

Link to Google calendar of the seminar

Seminar homepage for the fall semester, 2016-2017