University of Cambridge > Talks.cam > Combinatorics Seminar > configurations containing 4-term arithmetic progressions are uncommon

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

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

ℹī¸ Information

configurations containing 4-term arithmetic progressions are uncommon

Download to your calendar using vCal

  • UserLeo Versteegen (Cambridge)
  • ClockThursday 10 February 2022, 16:00-17:00
  • HouseCMS MR5.

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

A linear configuration is called common (in $\mathbb{F}_pn$) if every 2-coloring of $\mathbb{F}_pn$ yields at least the number of monochromatic instances of a randomly chosen coloring. Saad and Wolf asked whether, analogously to a result by Thomason in graph theory, every configuration containing a 4-term arithmetic progression is uncommon. I will sketch a proof confirming that this is the case and discuss some of the difficulties in finding a full characterisation of common configurations

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

LT1, Computer Laboratory, William Gates Building. venue JDB Seminar Room,, Engineering Design Centre, CUED

Other talks

Studying viruses to understand what makes pandemic viruses special and how innate immunity works Bacterial Physiology During Growth Arrest: Can It Be Targeted by Anti-Bacterial Therapeutics? LMB Seminar - Mechanisms of mRNA packaging and export Morning Break The Inaccessible Game Group Work
 

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