Corpus ID: 236635082

Towards a characterisation of Sidorenko systems

  title={Towards a characterisation of Sidorenko systems},
  author={Nina Kamvcev and Anita Liebenau and Natasha Morrison},
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 in a random set of the same density. Work of Saad and Wolf [18] and of Fox, Pham and Zhao [8] fully characterises single equations with this property and both sets of authors ask about a characterisation of Sidorenko systems of equations. In this paper, we make progress towards this goal. Firstly, we… 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


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
Linear configurations containing 4-term arithmetic progressions are uncommon
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, analogouslyExpand
Special cases of Shannon entropy., 2017
  • [Online; accessed 14-July-2021]
  • 2021
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
Sidorenko's conjecture for blow-ups
A celebrated conjecture of Sidorenko and Erdős-Simonovits states that, for all bipartite graphs H, quasirandom graphs contain asymptotically the minimum number of copies of H taken over all graphsExpand
Some advances on Sidorenko's conjecture
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
Special cases of Shannon entropy.
  • 2017
The number of additive triples in subsets of abelian groups
  • W. Samotij, B. Sudakov
  • Mathematics
  • Mathematical Proceedings of the Cambridge Philosophical Society
  • 2016
Abstract A set of elements of a finite abelian group is called sum-free if it contains no Schur triple, i.e., no triple of elements x, y, z with x + y = z. The study of how large the largest sum-freeExpand
Two approaches to Sidorenko’s
  • conjecture. Trans. Amer. Math. Soc.,
  • 2016
Entropy and Sidorenko’s conjecture – after Szegedy
  • 2015