Pattern-avoiding alternating words

15 May 2015 Gao Emma L. L. Kitaev Sergey Zhang Philip B.

A word $w=w_1w_2\cdots w_n$ is alternating if either $w_1<w_2>w_3<w_4>\cdots$ (when the word is up-down) or $w_1>w_2<w_3>w_4<\cdots$ (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMBINATORICS