** POSTPONED ** Linear configurations containing 4-term arithmetic progressions are uncommon

Add to your list(s) Download to your calendar using vCal

• Leo Versteegen (Cambridge)
• Thursday 27 January 2022, 14:30-15:30
• MR12.

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

This talk is postponed until Thursday 10th February

A linear configuration is called common (in $\mathbb{F}_p^{n$) if every 2-coloring of $\mathbb{F}_p}n$ 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:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• Combinatorics Seminar
• DPMMS Lists
• DPMMS Pure Maths Seminar
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.