University of Cambridge > Talks.cam > Discrete Analysis Seminar > Polynomial bounds for Chowla's cosine problem

  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

Polynomial bounds for Chowla's cosine problem

Download to your calendar using vCal

  • UserBenjamin Bedert (University of Cambridge)
  • ClockWednesday 26 November 2025, 13:30-14:30
  • HouseMR4, CMS.

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

Inspired by investigations of zeta functions, and old problem of Ankeny and Chowla asks whether any cosine polynomial f_A(x)=cos(a_1 x)+ ... +cos(a_n x), for an arbitrary set A={a_1,...a_n} of n distinct positive integers, must take a large negative value for some x in [0,2 pi]. Chowla later conjectured that the largest negative value of f_A is always at least of order n1/2, for any set A of size n. A refinement of Bourgain’s approach due to Ruzsa gave the previous record bound of exp(sqrt(log n)). In this talk, we discuss recent progress establishing the first polynomial bound nc with exponent c=1/7. We remark that Jin, Milojevic, Tomon and Zhang independently proved a polynomial bound with exponent c approximately 1/100 using a different method.

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

Soc Doc Soc AAAS members and friends event Kettle's Yard

Other talks

Summer Cactus & Succulent Show Title tbc Secrets of the Surface: The Mathematical Vision of Maryam Mirzakhani ( EDI Film Screening) CSAR lecture: 46&: Development of a probiotic that supports the natural removal of forever chemicals from the body Cambridge RNA Club - IN PERSON Market Failure, Organ Shortage, Pandemic and Climate Change: The Architecture of Cooperation
 

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