University of Cambridge > Talks.cam > Number Theory Seminar > Additive problems and exponential sums over smooth numbers

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

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

ℹī¸ Information

Additive problems and exponential sums over smooth numbers

Download to your calendar using vCal

  • UserAdam Harper (University of Cambridge)
  • ClockTuesday 01 December 2015, 14:15-15:15
  • HouseMR13.

If you have a question about this talk, please contact Jack Thorne .

A number is said to be y-smooth if all of its prime factors are at most y. Exponential sums over the y-smooth numbers less than x have been widely investigated, but existing results were weak for y too small compared with x. For example, if y is a power of log x then existing results were insufficient to study three variable additive problems involving smooth numbers (e.g. problems analogous to the three variable Goldbach conjecture), except by assuming conjectures like the Generalised Riemann Hypothesis.

I will try to describe my work on bounding mean values of exponential sums over smooth numbers, which allows an unconditional treatment of three variable additive problems even with y a (large) power of log x. There are connections with restriction theory and additive combinatorics.

This talk is part of the Number Theory Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Van Mildert College, Durham BCbD Annual Lecture 2021 The Parlour, Peterhouse

Other talks

The United States of America at 250: Reflections on the Past, Present and Future of Independence The organisational management of traumatic stress Title to follow Trigger-Level Analysis at ATLAS Formalising mathematics and spectral geometry in Lean BSU Seminar: "Response Adaptivity Across Clinical Trials In Portfolios of Biomedical Innovations"
 

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