\magnification=1440
\font\bigtenrm=cmr10 scaled\magstep4
Abstract for James D. Currie, A note on antichains of words

We can compress the word `banana' as $xyyz$, where
$x =$ `b', $y = $ `an',$z = $ `a'. We say that `banana' {\it encounters\/}
$yy$. Thus a `coded' version of $yy$ shows up in `banana'. The
relation `$u$ encounters $w$' is transitive, and thus generates
an order on words. We study antichains under this order.
In particular we show that in this order
there is
an infinite antichain of binary
words
avoiding overlaps.

\bye

.
