Linear configurations containing 4-term arithmetic progressions are uncommon

DOI10.1016/J.JCTA.2023.105792MaRDI QIDQ6133633zbMATH OpenOpenAlexFDO

Authors Leo Versteegen

Publication date 21 August 2023

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/2106.06846

zbMATH Keywords

4-AParithmetic progressioncommoncyclic grouplinear configuration

Mathematics Subject Classification ID

Generalized Ramsey theory (05C55) Ramsey theory (05D10) Other combinatorial number theory (11B75)

Abstract: A linear configuration is said to be common in $G$ if every 2-coloring of $G$ 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. We prove this in $mathbb{F}_p^n$ for $pgeq5$ and large $n$ and in $mathbb{Z}_p$ for large primes $p$.

Recommendations

• On the existence of rainbow 4-term arithmetic progressions
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• Common and Sidorenko linear equations
• Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
• The minimum number of monochromatic 4-term progressions in Z_p

Cites work

• A Disproof of a Conjecture of Erdős in Ramsey Theory
• A uniform set with fewer than expected arithmetic progressions of length 4
• Common and Sidorenko equations in abelian groups
• Common and Sidorenko linear equations
• Counting odd cycles in locally dense graphs
• Graph products and monochromatic multiplicities
• scientific article; zbMATH DE number 3188526 (Why is no real title available?)
• Linear configurations containing 4-term arithmetic progressions are uncommon
• Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
• Multiplicities of subgraphs
• On monochromatic solutions of equations in groups
• On Sets of Acquaintances and Strangers at any Party
• On the Ramsey multiplicity of complete graphs
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• The minimum number of monochromatic 4-term progressions in Z_p

Cited in

(12)

• Common and Sidorenko equations in abelian groups
• Ramsey multiplicity of linear patterns in certain finite abelian groups
• Linear configurations containing 4-term arithmetic progressions are uncommon
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
• On a common-extendable, non-Sidorenko linear system
• On uncommon systems of equations
• A new family of Sidorenko linear configurations
• Common pairs of graphs
• New Ramsey multiplicity bounds and search heuristics
• On the uncommonness of minimal rank-2 systems of linear equations
• Local aspects of the Sidorenko property for linear equations
• Vector space Ramsey numbers and weakly Sidorenko affine configurations

This page was built for publication: Linear configurations containing 4-term arithmetic progressions are uncommon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133633)