Indexed metadata

Avoiding abelian squares with three colours in the continuous setting

Ville Salo, Ingrid Vukusic, Charlie Wilson

Source record

Source: arXiv

Published: Oct 20, 2026

arXiv: 2610.28376

Open original source ↗

Source abstract

An nn-colouring of the real line is a Lebesgue measurable function f ⁣:R→Af \colon \mathbb{R} \to A, where AA is a set of nn colours. An abelian square for ff is a finite interval U⊆RU\subseteq \mathbb{R} where every colour shows up in the left and in the right half of UU with exactly the same Lebesgue measure. It is known that every 22-colouring contains an abelian square. On the other hand, Alon, Grytczuk, Laso{ń}, and Michałek (2009) proved that there exist 44-colourings that avoid abelian squares, while the question for 33-colourings remained open. We construct a 33-colouring that avoids abelian squares, disproving a conjecture of Laso{ń} (2015). However, in contrast to the case of 4-colourings, the set of 3-colourings that avoid abelian squares is meagre. We show this using an argument based on the KKM lemma.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Avoiding abelian squares with three colours in the continuous setting — Mathematical Frontier Network