An Improved Lower Bound for $n$-Brinkhuis $k$-Triples
Michael Sollami,
Craig C. Douglas,
Manfred Liebmann
Abstract:Let s n be the number of words in the ternary alphabet Σ = {0, 1, 2} such that no subword (or factor) is a square (a word concatenated with itself, e.g., 11, 1212, or 102102). From computational evidence, s n grows exponentially at a rate of about 1.317277 n . While known upper bounds are already relatively close to the conjectured rate, effective lower bounds are much more difficult to obtain. In this paper, we construct a 54-Brinkhuis 952-triple, which leads to an improved lower bound on the number of n-lett… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.