A One-Stop Source of Known Results, a Bibliography of Papers on the Subject, and Novel
Research Directions Focusing on a very active area of research in the last decade …

Generating functions which count occurrences of consecutive sequences in a permutation or
a word which matches a given pattern are studied by exploiting the combinatorics …

We find generating functions the number of strings (words) containing a specified number of
occurrences of certain types of order-isomorphic classes of substrings called subword …

If we consider the sequence with parenleftex-g eneral t erm an to be the vector a=(a0, a1,...)
then we obtain the binomial transform of parenleftex-t he s equence by multiplying this …

In 1990, West initiated an extensive investigation of the stack-sorting map, a deterministic
version of Knuth's stack-sorting machine that acts on permutations. At first sight, this map …

We introduce operators $\mathsf {hare} $ and $\mathsf {tortoise} $, which act on words as
natural generalizations of West's stack-sorting map. We show that the heuristically slower …

We say that a word w on a totally ordered alphabet avoids the word v if there are no
subsequences in w order-equivalent to v. In this paper we suggest a new approach to the …

Tree representations of (sets of) symmetric binary relations, or equivalently edge-colored
undirected graphs, are of central interest, eg in phylogenomics. In this context symbolic …

Symbolic ultrametrics define edge-colored complete graphs K_n K n and yield a simple tree
representation of K_n K n. We discuss, under which conditions this idea can be generalized …

arXiv:math/0112281v1 [math.CO] 27 Dec 2001 Page 1 arXiv:math/0112281v1 [math.CO] 27 Dec
2001 WORDS RESTRICTED BY 3-LETTER GENERALIZED MULTIPERMUTATION PATTERNS …