Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Wednesday, April 08, 2009, 12:15 pm

Duration: This information is not available in the database

Location: OAT S15/S16/S17

Speaker: David Belius (Univ. of Cambridge)

Discrete Harmonic Analysis and the Divisible Sandpile

In the recent paper "Strong Spherical Asymptotics for Rotor-Router Aggregation and the Divisible Sandpile" by L. Levine and Y. Peres the authors prove shape results about a number of deterministic growth models, one of them being the Divisible Sandpile. The key idea in their paper is the rather surprising technique of applying the discrete equivalent of harmonic analysis to this almost combinatorial problem. In this talk I will introduce the Divisible Sandpile model and Discrete Harmonic Analysis, and describe how the latter can be applied to prove an important lemma about the former.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login