<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>02000848</id>
  <dt>j</dt>
  <an>02000848</an>
  <augroup>
    <au>Sun, Xinyu</au>
  </augroup>
  <ti>New lower bound on the number of ternary square-free words.</ti>
  <so>J. Integer Seq. 6, No.3, Art. 03.3.2, 8 p., electronic only (2003).</so>
  <py>2003</py>
  <pu>School of Computer Science, University of Waterloo, Waterloo, ON</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
    <cc>G.2.1</cc>
  </ccgroup>
  <utgroup>
    <ut>Brinkhuis triple</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>emis:journals/JIS/VOL6/Sun/sun.html</li>
  </ligroup>
  <abgroup>
    <ab>Summary: A new lower bound on the number of $n$-letter ternary square-free words is presented: $110^{n/42}$, which improves the previous best result of $65^{n/40}$.</ab>
    <rv></rv>
  </abgroup>
</item>