Extremal 3-product-free set conjecture for free semigroups
Extremal 3-product-free set conjecture for free semigroups
Let be a finite set and let be the free semigroup with alphabet . If is 3-product-free and , consider the two types of label sets
and
Extremal 3-product-free set conjecture. One of the following holds: either the letters of can be labelled by so that is contained in the first set, or the letters can be labelled by so that is contained in the second set.
This is the free-semigroup analogue of the classification of extremal 3-sum-free sets in the non-negative integers. The density bound is established, but the extremal structure for is explicitly left open.
Sources & referencesView supporting material
Primary source
Freddie Illingworth, Lukas Michel and Alex Scott, “The structure and density of k-product-free sets in the free semigroup”, arXiv:2305.05304 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.