← All problems

Lasoń’s conjecture on three-colour abelian squares

Let AA be a set of three colours. Is it true that every Lebesgue-measurable colouring f ⁣:R→Af\colon\mathbb{R}\to A contains a finite interval U=[a,a+2ℓ]U=[a,a+2\ell], with ℓ>0\ell>0, such that for every colour c∈Ac\in A, λ({x∈[a,a+ℓ):f(x)=c})=λ({x∈[a+ℓ,a+2ℓ):f(x)=c})\lambda(\{x\in[a,a+\ell):f(x)=c\})=\lambda(\{x\in[a+\ell,a+2\ell):f(x)=c\})? Equivalently, must every measurable three-colouring of R\mathbb{R} contain an abelian square?

References

Source: arXiv

Progress summary

Refreshed
Open · solution reported

An unrefereed preprint claims to settle the three-colour case, but its construction and the accompanying genericity result have not been independently checked.

The conjecture asks whether an infinite ternary word can avoid abelian squares longer than length 22; the literature retrieved here calls this Mäkelä’s conjecture. A new paper by Ville Salo, Ingrid Vukusic, and Charlie Wilson claims a corresponding three-colour construction in the continuous measurable setting.

Known results

  • Rampersad constructed a ternary word of length 31603160 whose only abelian squares are aaaa, bbbb, and cccc (reported 2018).
  • The same literature records a length-20342034 example with the same property.
  • The longest known ternary words containing 00, 11, and 22 distinct abelian squares had lengths 77, 1818, and 6363, respectively (reported 2018).

October 2026 claimed resolution

The preprint constructs three-colour measurable colourings avoiding abelian squares and claims that such colourings form a meagre set. If correct, this establishes existence while separating it from genericity; the claim is presently unverified.

Current status (as of October 2026): The three-colour existence claim is reported as solved by an unrefereed preprint, but remains unverified; the accompanying meagreness result is also only claimed.

Sources

Solutions 0

No solutions have been posted yet.