There are More Than 2**(n/17) n-Letter Ternary Square-Free Words

arXivmath/9809135MaRDI QIDQ6501026

Author name not available (Why is that?)

Abstract: We prove that the `connective constant' for ternary square-free words is at least $2^{1/17}=\mathrm{1.0416...}$, improving on Brinkhuis and Brandenburg's lower bounds of $2^{1/24}=\mathrm{1.0293...}$ and $2^{1/22}=\mathrm{1.032...}$ respectively. This is the first improvement since 1983.

This page was built for publication: There are More Than 2**(n/17) n-Letter Ternary Square-Free Words

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