Linear configurations containing 4-term arithmetic progressions are uncommon

DOI10.1016/J.JCTA.2023.105792zbMATH Open1519.05244arXiv2106.06846OpenAlexW3169631338MaRDI QIDQ6133633FDOQ6133633

Leo Versteegen

Publication date: 21 August 2023

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

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$.

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

zbMATH Keywords

commonarithmetic progressioncyclic grouplinear configuration4-AP

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• 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
• Linear configurations containing 4-term arithmetic progressions are uncommon

   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 \(\mathbb Z_n\) 👍 👎
• The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\) 👍 👎

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)