Corpus ID: 235421711

Linear configurations containing 4-term arithmetic progressions are uncommon

@inproceedings{Versteegen2021LinearCC,
  title={Linear configurations containing 4-term arithmetic progressions are uncommon},
  author={Leo Versteegen},
  year={2021}
}
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 Fp for p ≥ 5 and large n and in Zp for large primes p. 
Uncommon Systems of Equations
A linear system L over Fq is common if the number of monochromatic solutions to L = 0 in any two-colouring of Fq is asymptotically at least the expected number of monochromatic solutions in a randomExpand
Towards a characterisation of Sidorenko systems
A system of linear forms L = {L1, . . . , Lm} over Fq is said to be Sidorenko if the number of solutions to L = 0 in any A ⊆ Fq is asymptotically as n → ∞ at least the expected number of solutions inExpand

References

SHOWING 1-10 OF 22 REFERENCES
Ramsey multiplicity of linear patterns in certain finite abelian groups
In this article we explore an arithmetic analogue of a long-standing open problem in graph theory: what can be said about the number of monochromatic additive configurations in 2-colourings of finiteExpand
The minimum number of monochromatic 4-term progressions in Z
In this paper we improve the lower bound given by Cameron, Cilleruelo and Serra for the minimum number of monochromatic 4term progressions contained in any 2-coloring of Zp with p a prime. We alsoExpand
Multiplicities of subgraphs
TLDR
It is shown that the conjecture that in any two-colouring of the edges of a large complete graph, the proportion of subgraphs isomorphic to a fixed graphG which are monochromatic is at least the proportion found in a random colouring fails, and in particular it fails for almost all graphs. Expand
Uncommon Systems of Equations
A linear system L over Fq is common if the number of monochromatic solutions to L = 0 in any two-colouring of Fq is asymptotically at least the expected number of monochromatic solutions in a randomExpand
Common And Sidorenko Linear Equations
A linear equation with coefficients in $\mathbb{F}_q$ is common if the number of monochromatic solutions in any two-coloring of $\mathbb{F}_q^n$ is (as $n \to \infty$) asymptotically at least theExpand
Some advances on Sidorenko's conjecture
TLDR
An embedding algorithm is developed which allows us to prove that bipartite graphs admitting a certain type of tree decomposition have Sidorenko’s property. Expand
On the number of complete subgraphs contained in certain graphs
TLDR
The number of complete graphs of order 4 contained in certain graphs is counted to find the total number of graphs in the graph LaSalle's inequality. Expand
Common and Sidorenko equations in Abelian groups
A linear configuration is said to be common in a finite Abelian group G if for every 2-coloring of G the number of monochromatic instances of the configuration is at least as large as for a randomlyExpand
Linear configurations containing 4-term arithmetic progressions are uncommon
  • 2021
A uniform set with fewer than expected arithmetic progressions of length 4
An example is constructed of a subset $$A \subset \mathbb {Z}_N$$ A ⊂ Z N of density $${1\over 2}+o(1)$$ 1 2 + o ( 1 ) such that all the non-trivial Fourier coefficients of the characteristicExpand
...
1
2
3
...