Results 131 to 140 of about 183,560 (141)

A New Class of Wilf-Equivalent Permutations [PDF]

open access: yesJournal of Algebraic Combinatorics, 2002
20 pages, 14 figures, corrected ...
Julian West
exaly   +4 more sources

Shape-Wilf-Equivalences for Vincular Patterns

open access: yesAdvances in Applied Mathematics, 2013
We extend the notion of shape-Wilf-equivalence to vincular patterns (also known as "generalized patterns" or "dashed patterns"). First we introduce a stronger equivalence on patterns which we call filling-shape-Wilf-equivalence. When vincular patterns $α$ and $β$ are filling-shape-Wilf-equivalent, we prove that the direct sum $α\oplusσ$ is filling ...
Andrew M Baxter
exaly   +4 more sources

Wilf Equivalence Relations for Consecutive Patterns [PDF]

open access: yesAdvances 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

A New Class of Multiset Wilf Equivalent Pairs

open access: yesDiscrete Mathematics, 2007
Let \(M\) be a multiset. A pair of patterns \((\sigma,\tau)\) is called multiset Wilf equivalent if, for any \(M\), the number of permutations of \(M\) that avoid \(\sigma\) is equal to the number of permutations of \(M\) that avoid \(\tau\). In this paper the author shows that if \(\sigma_{n-2}\) is a permutation of \(\{1^{x_1}, 2^{x_2},\dots, (n-2 ...
exaly   +4 more sources

New Wilf-Equivalence Results for Vincular Patterns

open access: yesEuropean Journal of Combinatorics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exaly   +3 more sources
Some of the next articles are maybe not open access.

Related searches:

Further Refinements of Wilf-Equivalence for Patterns of Length 4

Journal of Combinatorial Theory - Series A
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robin D P Zhou, Sherry H F Yan
exaly   +2 more sources

Wilf Equivalences for Patterns in Rooted Labeled Forests

open access: yesAdvances in Applied Mathematics
Building off recent work of Garg and Peng, we continue the investigation into classical and consecutive pattern avoidance in rooted forests, resolving some of their conjectures and questions and proving generalizations whenever possible. Through extensions of the forest Simion-Schmidt bijection introduced by Anders and Archer, we demonstrate a new ...
exaly   +5 more sources

Operators of Equivalent Sorting Power and Related Wilf-Equivalences

Electronic Journal of Combinatorics, 2014
Michael H. Albert, Mathilde Bouvel
exaly  

Fine and Wilf's Theorem for K-Abelian Periods

International Journal of Foundations of Computer Science, 2013
Aleksi Mikael Saarela   +2 more
exaly  

Enumeration of 2-Wilf Classes of Four 4-Letter Patterns

Turkish Journal of Analysis and Number Theory, 2017
Toufik Mansour
exaly  

Home - About - Disclaimer - Privacy