745 search results - page 5 / 149 » The origins of combinatorics on words |
COMBINATORICS
2004
13 years 8 months ago
2004
A word is abelian square-free if it does not contain two adjacent subwords which are permutations of each other. Over an alphabet k on k letters, an abelian squarefree word is max...
COMBINATORICS
2000
13 years 8 months ago
2000
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
COMBINATORICS
2000
13 years 8 months ago
2000
We constructively prove that the partially ordered set of finite permutations ordered by deletion of entries contains an infinite antichain. In other words, there exists an infini...
COMBINATORICS
2000
13 years 8 months ago
2000
: We prove two extensions of the Hales-Jewett coloring theorem. The first is a polynomial version of a finitary case of Furstenberg and Katznelson's multiparameter elaboration...
COMBINATORICS
2007
13 years 8 months ago
2007
The idea of graph compositions, which was introduced by A. Knopfmacher and M. E. Mays, generalizes both ordinary compositions of positive integers and partitions of finite sets. ...