There are More Than 2**(n/17) n-Letter Ternary Square-Free Words
Doron Zeilberger
Abstract
We prove that the `connective constant' for ternary square-free words is at least 21/17 = 1.0416 ... , improving on Brinkhuis and Brandenburg's lower bounds of 21/24=1.0293 ... and 21/22=1.032 ... respectively. This is the first improvement since 1983.
Create a lesson
Related papers
Combinatorics of hyperplane arrangements and Witten zeta function at the origin
Kam Cheong Au, Kazuhiro Onodera
Proof of the Pach-Tardos conjecture
Lior Gishboliner, Xiangyu Li
Longest cycles intersect linearly in highly connected graphs
Jie Ma, Bo Ning, Ziyuan Zhao
Cutting a convex body into fat parts and approximating Euclidean distance by graph distances
János Pach, Gábor Tardos
A counterexample to the quantum Hedetniemi conjecture
Julius A. Zeiss
Schrijver-Delsarte rigidity in association schemes and undecidability of quantum graph homomorphism
Lorenzo Ciardo, Iris Hebbeker, Gideo Joubert et al.