ARC5 - Distinguished Lecture by Noga Alon, Tel Aviv University, Israel and Persi Diaconis, Stanford University

Primary tabs

Speaker: Noga Alon, Tel Aviv UniversityTitle: On graphs, arithmetic progressions and communicationAbstract:Tools from Extremal Graph Theory are helpful in the study of problems in Additive Number Theory, Theoretical Computer Science, and Information Theory. I will illustrate this fact by several closely related examples focusing on a recent one in a joint paper with Moitra and Sudakov.Speaker: Persi DiaconisTitle: "An Introduction to additive combinatorics via 'carries'"AbstractWhen numbers are added in the usual way, "carries" occur.  The chance of a carry is about .45 (base 10).  There are other choices of digits that lead to fewer carries (balanced digits).  These balanced systems turn out to be best (fewest carries).  Showing this requires an excursion into additive combinatorics a la Gowers-Green-Szemeredi-Tao.  This is joint work with Shao and Soundarajan.See All Workshop presentations and videos hereProgramSchedule
  • 9:00 am - Breakfast (Klaus atrium)
  • 9:30 am - Keynote: Noga Alon
  • 10:30 am - Break
  • 10:45 am - Talks (25 min each) by:
    • Greg Blekherman (Math)
    • Frank Dellaert (CoC)
    • Justin Romberg (ECE)
  • 12:15 pm - Lunch (Klaus atrium, with the student poster session for viewing)
  • 1:30 pm - Keynote: Persi Diaconis


  • Workflow Status: Published
  • Created By: Elizabeth Ndongi
  • Created: 05/10/2012
  • Modified By: Fletcher Moore
  • Modified: 10/07/2016


No keywords were submitted.

Target Audience