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

Event Details
  • Date/Time:
    • Tuesday August 28, 2012 - Wednesday August 29, 2012
      9:00 am - 8:59 am
  • Location: Klaus 1116
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:


Summary Sentence: No summary sentence submitted.

Full Summary: No summary paragraph submitted.

Related Files

Speaker: Noga Alon, Tel Aviv University

Title: On graphs, arithmetic progressions and communication


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 Diaconis

Title: "An Introduction to additive combinatorics via 'carries'"


When 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 here



  • 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

Additional Information

In Campus Calendar

College of Computing, School of Computer Science, ARC

Invited Audience
No audiences were selected.
No keywords were submitted.
  • Created By: Elizabeth Ndongi
  • Workflow Status: Published
  • Created On: May 10, 2012 - 4:59am
  • Last Updated: Oct 7, 2016 - 9:58pm