COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Combinatorics Seminar > Linear configurations containing 4-term arithmetic progressions are uncommon
Linear configurations containing 4-term arithmetic progressions are uncommonAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact ibl10. This talk has been canceled/deleted 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:This talk is not included in any other list Note that ex-directory lists are not shown. |
Other listsCancer Genetic Epidemiology Seminar Series Cambridge Central Asia Forum Quantum InformationOther talksFrom Pandemic to Endemicity: Is Behavior Over or Underweighted in Modeling the COVID-19 Pandemic? Gateway Soft Matter Non-local Pearson diffusions Teach-out: RENATA ÁVILA (CEO, Open Knowledge Foundation) Fractional characteristic functions and fractional moments Gateway |