University of Cambridge > Talks.cam > Combinatorics Seminar > The number of monochromatic solutions to multiplicative equations

  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

The number of monochromatic solutions to multiplicative equations

Download to your calendar using vCal

  • UserVictor Souza (Cambridge)
  • ClockThursday 24 October 2024, 14:30-15:30
  • HouseMR12.

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

Given an r-colouring of the interval {2,...,N}, what is the minimum number of monochromatic solutions of the equation xy = z? For r = 2, we show that there are always asymptotically at least (1/2sqrt(2)) N log(N) monochromatic solutions, and that the leading constant is sharp. We also establish a stability version of this result. For general r, we show that there are at least C_r N(1/S(r-1)) monochromatic solutions, where S® is the Schur number for r colours and C_r is a constant. This bound is sharp up to logarithmic factors when r <= 4. We also obtain results for more general multiplicative equations.

This talk is part of the Combinatorics Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

1st Floor Conservation Science Lab, Zoology Department, New Museums Site Zoom: to receive link please register at https://www.hist.cam.ac.uk/event-series/global-economic-history Institute of Metabolic Science (IMS), Level 4, Seminar rooms 1-2

Other talks

Afternoon Break A novel hereditary encephalopathy in four related Labrador Retrievers associated with a missense variant in the ALDH5A1 gene’ C2D3 Computational Biology Annual Symposium 2026 An AI-Assisted Proof in Spectral Geometry Title TBC Tea and Coffee Break
 

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