Recognition: unknown
Product-free sets in the free semigroup
classification
🧮 math.CO
keywords
freeproduct-freesemigroupalphabetassignsdensityfinitelength
read the original abstract
In this paper, we study product-free subsets of the free semigroup over a finite alphabet $A$. We prove that the maximum density of a product-free subset of the free semigroup over $A$, with respect to the natural measure that assigns a weight of $|A|^{-n}$ to each word of length $n$, is precisely $1/2$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.