University of Cambridge > Talks.cam > Discrete Analysis Seminar > Bounds for sets lacking x,x+y,x+y^2

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹ️ Information

Bounds for sets lacking x,x+y,x+y^2

Download to your calendar using vCal

If you have a question about this talk, please contact Aled Walker .

Let P_1,...,P_m be polynomials with zero constant term. Bergelson and Leibman’s generalization of Szemerédi’s theorem to polynomial progressions states that any subset A of [N] that lacks nontrivial progressions of the form x,x+P_1(y),\dots,x+P_m(y) satisfies |A|=o(N). Proving quantitative bounds in the Bergelson—Leibman theorem is an interesting and difficult generalization of the problem of proving bounds in Szemerédi’s theorem, and bounds are known only in a very small number of special cases. In this talk, I’ll discuss a bound for subsets of [N] lacking the progression x,x+y,x+y^2, which is the first progression of length at least three involving polynomials of differing degree for which a bound is known. This is joint work with Sean Prendiville.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

New Hall Bar, Huntingdon Road Webinar & FW11, Computer Laboratory, William Gates Building. Lecture Theatre 1, Department of Chemical Engineering & Biotechnology, Philippa Fawcett Drive, Cambridge CB3 0AS

Other talks

Disentangling preventative & ejective AGN feedback on a population basis with simulations, observations & machine learning Online Causal Inference Seminar Online Causal Inference Seminar Advances in Label-Free High-Resolution Molecular Imaging using J Series III Cluster SIMS Title to be confirmed Talk TBC
 

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