24 search results - page 1 / 5 » Combinatorics on partial word correlations |
JCT
2010
13 years 3 months ago
2010
COMBINATORICS
2000
13 years 4 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...
MST
2010
13 years 3 months ago
2010
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
COMBINATORICS
2007
13 years 4 months ago
2007
We define a partial order on colored compositions with many properties analogous to Young’s lattice. We show that saturated chains correspond to colored permutations, and that ...
STACS
2007
Springer
13 years 10 months ago
2007
Springer