![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Yuval Peres (Microsoft Research)
Thursday 03 November 2011, 14:30-15:30
Two Erdős problems on lacunary sequences: chromatic number and Diophantine approximation
- 👤 Speaker: Yuval Peres (Microsoft Research)
- 📅 Date & Time: Thursday 03 November 2011, 14:30 - 15:30
- 📍 Venue: MR12
Abstract
Abstract: Let {n_k} be a lacunary sequence, i.e., the ratio of successive elements of the sequence is at least some q>1. In 1987, Erdős asked for the chromatic number of a graph G on the integers, where two integers are connected by an edge iff their difference is in the sequence {n_k}. Y.Katznelson found a connection via a to a Diophantine approximation problem: finding irrationals x such that n_k times x is at least r>0 away from the integers for all k. In joint work with W.Schlag, we improve Katznelson’s bounds for both problems using the Lovasz local lemma. It is still an unsolved problem to obtain matching upper and lower bounds.
Series This talk is part of the Combinatorics Seminar series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- Combinatorics Seminar
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- DPMMS Pure Maths Seminar
- Hanchen DaDaDash
- Interested Talks
- MR12
- School of Physical Sciences
Note: Ex-directory lists are not shown.