Product-free sets in the free group

arXiv2302.03748MaRDI QIDQ6508730FDOQ6508730

Authors: Miquel Ortega, Juanjo Rué, Oriol Serra 

Abstract: We prove that product-free sets of the free group over a finite alphabet have maximum density $1/2$ with respect to the natural measure that assigns total weight one to each set of irreducible words of a given size. This confirms a conjecture of Leader, Letzter, Narayanan and Walters. In more general terms, we actually prove that strongly $k$-product-free sets have maximum density $1/k$ in terms of the said measure.

This page was built for publication: Product-free sets in the free group

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508730)