A combinatorial property of the factor poset of a word
We prove the following interesting combinatorial property of the poset of the factors of a word. Let w be a word and n = G(w) + 2, where G(w) is the maximal length of a repeated factor of w. If v is any word such that the posets of the factors of v and of w up to length n are isomorphic, then v can be obtained by renaming the letters of w or of the reversal of w. (C) 2002 Elsevier Science B.V. All rights reserved.
factor poset combinatorial problems similar words