University of Cambridge > Talks.cam > Discrete Analysis Seminar > Polynomial configurations in the primes

Polynomial configurations in the primes

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

  • UserJulia Wolf (Paris)
  • ClockWednesday 30 January 2013, 16:00-17:00
  • HouseMR11, CMS.

If you have a question about this talk, please contact Ben Green.

The Bergelson-Leibman theorem states that if P_1, ... , P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), \dots, x+P_k(m), where x,m are integers. Various generalizations of this theorem are known. Wooley and Ziegler showed that the variable m can in fact be taken to be a prime minus 1, and Tao and Ziegler showed that the Bergelson-Leibman theorem holds for subsets of the primes of positive relative upper density. In this talk we discuss a hybrid of the latter two results, namely that the step m in the Tao-Ziegler theorem can be restricted to the set of primes minus 1. This is joint work with Thai Hoang Le.

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.

 

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