There are More Than 2**(n/17) n-Letter Ternary Square-Free Words
| dc.creator | Zeilberger, Doron | |
| dc.date | 1998-09-23 | |
| dc.date.accessioned | 2026-07-07T05:26:07Z | |
| dc.date.available | 2026-07-07T05:26:07Z | |
| dc.description | We prove that the `connective constant' for ternary square-free words is at least $2^{1/17} = 1.0416 ... $, improving on Brinkhuis and Brandenburg's lower bounds of $2^{1/24}=1.0293 ...$ and $2^{1/22}=1.032 ...$ respectively. This is the first improvement since 1983. | |
| dc.description | 2 pages (plain TeX) | |
| dc.identifier | https://arxiv.org/abs/math/9809135 | |
| dc.identifier | http://arxiv.org/abs/math/9809135 | |
| dc.identifier | J. Integer Sequences 98.1.9 (1998) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/77436 | |
| dc.subject | Combinatorics | |
| dc.title | There are More Than 2**(n/17) n-Letter Ternary Square-Free Words | |
| dc.type | text |