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

configurations containing 4-term arithmetic progressions are uncommon

Add to your list(s) 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 ibl10.

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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