[seqfan] Re: help needed with former sequence A138036

franktaw at netscape.net franktaw at netscape.net
Mon Sep 5 00:31:58 CEST 2011

Hugo left out a key word in his abbreviation of the text:
    ... Abelian squares are unavoidable ...

I think "Abelian square" means that the word has the form XABY, where A 
and B contain the same non-empty multiset of letters; then the AB are 
an Abelian square.

What this has to do with the sequence I don't know.

Question: does every sufficiently long string over a finite alphabet 
contain an Abelian square in this sense? (Note that, since there are 
only finitely many choices at each step, the existence of arbitrarily 
long squarefree sequences implies the existence of an infinite such 
sequence. (The reverse is trivial, of course.))

Franklin T. Adams-Watters

-----Original Message-----
From: hv <hv at crypt.org>

I don't speak Mathematica; by eye, the first list looks like all
square-free sequences in a 3-symbol alphabet ordered first by length,
then lexically.

Looking back at the history, it seems to be a demonstration of this:

  [T]his computation shows that [...] squares are unavoidable over
  3 letters, since every word of length 8 turns out to contain them.

.. unfortunately swaddled in so much semi-mystical verbiage as to be
effectively encrypted.

Replacing the mysticism with a clear explanation would probably be
sufficient to make this worth keeping.


More information about the SeqFan mailing list