Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Improved bounds on the number of ternary square-free words   Improved upper and lower bounds on the number of square-free ternary words
are obtained. The upper bound is based on the enumeration of square-free
ternary words up to length 110. The lower bound is derived by constructing
generalised Brinkhuis triples. The problem of finding such triples can
essentially be reduced to a combinatorial problem, which can efficiently be
treated by computer. In particular, it is shown that the number of square-free
ternary words of length n grows at least as 65^(n/40), replacing the previous
best lower bound of 2^(n/17).

0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
25
The categories of this paper are: patt-sol
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
35
The categories of this paper are: mtrl-th
11
The categories of this paper are: hep-lat
20
The categories of this paper are: acc-phys
30
The categories of this paper are: q-alg
10
The categories of this paper are: q-bio
23
The categories of this paper are: solv-int
15
The categories of this paper are: nucl-ex
13
The categories of this paper are: quant-ph
27
The categories of this paper are: comp-gas
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph