Pattern Avoidance in Reverse Double Lists
In this paper, we consider pattern avoidance in a subset of words on $\{1,1,2,2,\dots,n,n\}$ called reverse double lists. In particular a reverse double list is a word formed by concatenating a permutation with its reversal. We enumerate reverse double lists avoiding any permutation pattern of lengt...
| मुख्य लेखकों: | , , , |
|---|---|
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Discrete Mathematics & Theoretical Computer Science
2018-10-01
|
| श्रृंखला: | Discrete Mathematics & Theoretical Computer Science |
| विषय: | |
| ऑनलाइन पहुंच: | https://dmtcs.episciences.org/3289/pdf |