Product-free sets in the free semigroup

Imre Leader, Shoham Letzter, Bhargav Narayanan, Mark Walters

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Article number103003
JournalEuropean Journal of Combinatorics
Volume83
DOIs
StatePublished - Jan 2020

Fingerprint

Free Semigroup
Free Product
Subset
Assign

All Science Journal Classification (ASJC) codes

  • Discrete Mathematics and Combinatorics

Cite this

Leader, Imre ; Letzter, Shoham ; Narayanan, Bhargav ; Walters, Mark. / Product-free sets in the free semigroup. In: European Journal of Combinatorics. 2020 ; Vol. 83.
@article{bd020fc907e04f7ba14b2afb65e1daf9,
title = "Product-free sets in the free semigroup",
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.",
author = "Imre Leader and Shoham Letzter and Bhargav Narayanan and Mark Walters",
year = "2020",
month = "1",
doi = "https://doi.org/10.1016/j.ejc.2019.103003",
language = "English (US)",
volume = "83",
journal = "European Journal of Combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",

}

Product-free sets in the free semigroup. / Leader, Imre; Letzter, Shoham; Narayanan, Bhargav; Walters, Mark.

In: European Journal of Combinatorics, Vol. 83, 103003, 01.2020.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Product-free sets in the free semigroup

AU - Leader, Imre

AU - Letzter, Shoham

AU - Narayanan, Bhargav

AU - Walters, Mark

PY - 2020/1

Y1 - 2020/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85070678192&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85070678192&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.ejc.2019.103003

DO - https://doi.org/10.1016/j.ejc.2019.103003

M3 - Article

VL - 83

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

SN - 0195-6698

M1 - 103003

ER -