University of Cambridge > Talks.cam > Combinatorics Seminar > Lower bounds for van der Waerden 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

Lower bounds for van der Waerden numbers

Download to your calendar using vCal

  • User Zach Hunter (ETH Zurich)
  • ClockThursday 19 February 2026, 14:30-15:30
  • HouseMR12.

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

The van der Waerden number W(k,r) denotes the smallest n such that whenever the set {1,...,n} is colored with r colors there exists a monochromatic k-term arithmetic progression. In this talk we will present some new lower bounds in the multicolored case (meaning that r is at least 3).

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

Average on weekdays: 8935.15124153 kWh Institute of Metabolic Science (IMS), Level 4 ATC, Seminar rooms 1,2 & 3 Room 146, RFB

Other talks

Toward high resolution structure/function analyses of sensorimotor integration in ciliated protists Talk TBC Reachability Types, Traces, and Full Abstraction An AI-Assisted Proof in Spectral Geometry The role of radiation in cancer care: a spotlight on cancers of the oesophagus, head and neck Cultural evolution creates language-like structure: from humans to humpback whales and beyond
 

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