For more information about this meeting, contact Sergei Tabachnikov.

Title: | Complete Sequences |

Seminar: | Department of Mathematics Colloquium |

Speaker: | Van Vu, Rutgers University |

Abstract: |

A basic problem in number theory is to represent the natural numbers as sums of elements of a sparse sequence. In 1962, Paul Erdos came up with the following notion. A sequence is complete if its partial sums contains all natural numbers with finite exceptions. He raised the question of characterizing all complete sequences. In this talk, I will briefly survey the history of this problem and then discuss a recent result (joint with Endre Szemeredi) which solves Erdos' problem. The main idea of the proof comes from the fast growing field of additive combinatorics. |

### Room Reservation Information

Room Number: | MB114 |

Date: | 03 / 17 / 2011 |

Time: | 04:00pm - 05:00pm |