University of Cambridge > Talks.cam > Discrete Analysis Seminar > Roth's theorem on arithmetic progressions

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

Roth's theorem on arithmetic progressions

Add to your list(s) Download to your calendar using vCal

  • UserTom Sanders (University of Cambridge)
  • ClockTuesday 23 November 2010, 17:30-18:30
  • HouseMR4, CMS.

If you have a question about this talk, please contact Pablo Candela.

We shall discuss upper bounds for the size of the largest subset of the positive integers less than some integer N not containing any triple of distinct elements in arithmetic progression.

This talk is part of the Discrete Analysis Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Cambridge University International Development Society King's Graduate Seminar St Catharine's Lecture Series

Other talks

Refugees and Migration Determining structures in situ using cryo-electron tomography:enveloped viruses and coated vesicles UK 7T travelling-head study: pilot results Debtors’ schedules: a new source for understanding the economy in 18th-century England Renationalisation of the Railways. A CU Railway Club Public Debate. Singularities of Hermitian-Yang-Mills connections and the Harder-Narasimhan-Seshadri filtration Single Cell Seminars (August) An approach to the four colour theorem via Donaldson- Floer theory Are hospital admissions for people with palliative care needs avoidable and unwanted? A transmissible RNA pathway in honeybees Part Ib Group Project Presentations
 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity