Counting permutations with given cycle structure and descent set
Journal of Combinatorial Theory Series A
Varieties Of Formal Languages
A note on the Burrows-Wheeler transformation
Theoretical Computer Science
An extension of the Burrows–Wheeler Transform
Theoretical Computer Science
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
| Hi-index | 5.23 |
We formulate and explain the extended Burrows-Wheeler transform of Mantaci et al. from the viewpoint of permutations on a chain taken as a union of partial order-preserving mappings. In so doing we establish a link with syntactic semigroups of languages that are themselves cyclic semigroups. We apply the extended transform with a view to generating de Bruijn words through inverting the transform. We also make use of de Bruijn words to facilitate a proof that the maximum number of distinct factors of a word of length n has the form 12n^2-O(nlogn).