In this paper, we consider pattern avoidance in a subset of words on t1, 1, 2, 2, . . . , n, nu 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 length at most 4 and completely determine the corresponding Wilf classes. For permutation patterns ρ of length 5 or more, we characterize when the number of ρ-avoiding reverse double lists on n letters has polynomial growth. We also determine the number of 1 ¨ ¨ ¨ k-avoiders of maximum length for any positive integer k
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-d...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
AbstractWe find generating functions for the number of compositions avoiding a single pattern or a p...
In this paper, we consider pattern avoidance in a subset of words on t1, 1, 2, 2, . . . , n, nu call...
In this paper, we consider pattern avoidance in a subset of words on$\{1,1,2,2,\dots,n,n\}$ called r...
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over ...
We consider pattern avoidance in a subset of words on {1,1,2,2,…,n,n} called double lists. We enumer...
A word w=w1w2⋯wn is alternating if either w1<w2>w3<w4>⋯ (when the word is up-down) or w1>w2<w3>w4<⋯ ...
Abstract In this paper, we discuss the enumeration of words avoiding patterns with repeated letters....
A word is an ordered list of numbers. Specifically, a permutation is a word without repeated letters...
Pattern avoidance is an important research topic in combinatorics on words which dates bac...
Color poster with text, table, and equations.We build on previous research into pattern avoidance in...
In [BabStein] Babson and Steingrimsson introduced generalized permutation patterns that allow the re...
Color poster with text and diagrams.This project studies pattern avoidance in colored permutations (...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
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-d...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
AbstractWe find generating functions for the number of compositions avoiding a single pattern or a p...
In this paper, we consider pattern avoidance in a subset of words on t1, 1, 2, 2, . . . , n, nu call...
In this paper, we consider pattern avoidance in a subset of words on$\{1,1,2,2,\dots,n,n\}$ called r...
In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over ...
We consider pattern avoidance in a subset of words on {1,1,2,2,…,n,n} called double lists. We enumer...
A word w=w1w2⋯wn is alternating if either w1<w2>w3<w4>⋯ (when the word is up-down) or w1>w2<w3>w4<⋯ ...
Abstract In this paper, we discuss the enumeration of words avoiding patterns with repeated letters....
A word is an ordered list of numbers. Specifically, a permutation is a word without repeated letters...
Pattern avoidance is an important research topic in combinatorics on words which dates bac...
Color poster with text, table, and equations.We build on previous research into pattern avoidance in...
In [BabStein] Babson and Steingrimsson introduced generalized permutation patterns that allow the re...
Color poster with text and diagrams.This project studies pattern avoidance in colored permutations (...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
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-d...
In 2012, Sagan and Savage introduced the notion of st-Wilf equivalence for a statistic st and for se...
AbstractWe find generating functions for the number of compositions avoiding a single pattern or a p...
Add to ORKG