Results 121 to 130 of about 176,018 (136)
Wilf equivalence relations for consecutive patterns [PDF]
Advances in Applied Mathematics, 2018 Two permutations $π$ and $τ$ are c-Wilf equivalent if, for each $n$, the number of permutations in $S_n$ avoiding $π$ as a consecutive pattern (i.e., in adjacent positions) is the same as the number of those avoiding $τ$. In addition, $π$ and $τ$ are strongly c-Wilf equivalent if, for each $n$ and $k$, the number of permutations in $S_n$ containing $k$
Sergi Elizalde
exaly +4 more sources
On (shape-)Wilf-equivalence for words [PDF]
Advances in Applied Mathematics, 2018 AmS-LaTeX, 13 pages; minor ...
Christian Krattenthaler
exaly +4 more sources
Wilf equivalences between vincular patterns in inversion sequences [PDF]
Applied Mathematics and Computation, 2021 18 pages, 9 ...
Sergi Elizalde
exaly +5 more sources
Decreasing Subsequences in Permutations and Wilf Equivalence for Involutions [PDF]
Journal of Algebraic Combinatorics, 2005 In a recent paper, Backelin, West and Xin describe a map $ϕ^*$ that recursively replaces all occurrences of the pattern $k... 21$ in a permutation $σ$ by occurrences of the pattern $(k-1)... 21 k$. The resulting permutation $ϕ^*(σ)$ contains no decreasing subsequence of length $k$.
Einar Steingrimsson +2 more
exaly +3 more sources
New Wilf-equivalence results for vincular patterns
European Journal of Combinatorics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly +3 more sources
Shift equivalence in the generalized factor order [PDF]
Archiv Der Mathematik, 2018 We provide a geometric condition that guarantees strong Wilf equivalence in the generalized factor order. This provides a powerful tool for proving specific and general Wilf equivalence results, and several such examples are ...
Jay Pantone, Daniel Glasscock
exaly +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Further refinements of Wilf-equivalence for patterns of length 4
Journal of Combinatorial Theory - Series AzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robin Dapao Zhou, Sherry H F Yan
exaly +2 more sources
A refinement of Wilf-equivalence for patterns of length 4
Journal of Combinatorial Theory - Series A, 2014 In their paper \cite{DokosDwyer:Permutat12}, Dokos et al. conjecture that the major index statistic is equidistributed among 1423-avoiding, 2413-avoiding, and 2314-avoiding permutations. In this paper we confirm this conjecture by constructing two major index preserving bijections, $Θ:S_n(1423)\to S_n(2413)$ and $Ω:S_n(2314)\to S_n(2413)$.
exaly +5 more sources
Proof of a conjecture on the shape-Wilf-equivalence for partially ordered patterns
European Journal of CombinatoricsA partially ordered pattern (abbreviated POP) is a partially ordered set (poset) that generalizes the notion of a pattern when we are not concerned with the relative order of some of its letters. The notion of partially ordered patterns provides a convenient language to deal with large sets of permutation patterns.
Sherry H F Yan
exaly +5 more sources
Descents and des-Wilf equivalence of permutations avoiding certain nonclassical patterns [PDF]
Involve, 2019 A frequent topic in the study of pattern avoidance is identifying when two sets of patterns $Π, Π'$ are Wilf equivalent, that is, when $|\text{Av}_n(Π)| = |\text{Av}_n(Π')|$ for all $n$. In recent work of Dokos et al. the notion of Wilf equivalence was refined to reflect when avoidance of classical patterns preserves certain statistics. In this article,
Robert Davis
exaly +4 more sources