Back to Search
Start Over
Product-free sets in the free semigroup.
- Source :
-
European Journal of Combinatorics . Jan2020, Vol. 83, pN.PAG-N.PAG. 1p. - Publication Year :
- 2020
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 83
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 138958927
- Full Text :
- https://doi.org/10.1016/j.ejc.2019.103003