1 citations · 1 across the 2 of their papers we have counts for
3 papers
math.CO2018
Wilf equivalence relations for consecutive patterns
Tim Dwyer, Sergi Elizalde
Two permutations and are c-Wilf equivalent if, for each , the number of permutations in avoiding as a consecutive pattern (i.e., in adjacent positions) is the…
math.CO2012★ 1 cited
On 021-Avoiding Ascent Sequences
William Y. C. Chen, Alvin Y. L. Dai, Theodore Dokos +2
Ascent sequences were introduced by Bousquet-Mélou, Claesson, Dukes and Kitaev in their study of -free posets. An ascent sequence of length is a nonnegative integer…
math.CO2011
Permutation patterns and statistics
Theodore Dokos, Tim Dwyer, Bryan P. Johnson +2
Let S_n denote the symmetric group of all permutations of the set {1, 2, ...,n} and let S = \cup_{n\ge0} S_n. If Pi is a set of permutations, then we let Av_n(Pi) be the set of per…