University of Cambridge > Talks.cam > Discrete Analysis Seminar > An inverse theorem for the Gowers U^3 norm relative to quadratic level sets

  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

An inverse theorem for the Gowers U^3 norm relative to quadratic level sets

Download to your calendar using vCal

  • UserSean Prendiville (Lancaster University) Speaker website
  • ClockWednesday 27 November 2024, 13:30-15:00
  • HouseMR4, CMS.

If you have a question about this talk, please contact Julia Wolf .

The Gowers uniformity norms have become well-used tools in additive combinatorics, ergodic theory and analytic number theory. We discuss an effective version of the inverse theorem for the Gowers U^3-norm for functions supported on high-rank quadratic level sets in finite vector spaces. This enables one to run density increment arguments with respect to quadratic level sets, which are analogues of Bohr sets in the context of quadratic Fourier analysis on finite vector spaces. For instance, one can derive a polyexponential bound on the Ramsey number of three-term progressions which are the same colour as their common difference (“Brauer quadruples”), a result it seems difficult to obtain by other means.

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

Cavendish Laboratory, Pippard Lecture Theatre & TEAMS Average on Sundays: 7245.03846154 kWh Molecular, Structural & Cellular Microbiology

Other talks

Understanding the Interplay between LLMs' Utilisation of Parametric and Contextual Knowledge Title to be confirmed Cooperation for Nature Tea and Coffee Break Cultural evolution creates language-like structure: from humans to humpback whales and beyond LMB Seminar - Mechanisms of mRNA packaging and export
 

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