326 search results - page 2 / 66 » Algorithms for Pattern Involvement in Permutations |
106
Voted
ORDER
2002
15 years 23 days ago
2002
It is known that the "pattern containment" order on permutations is not a partial well-order. Nevertheless, many naturally defined subsets of permutations are partially ...
75
Voted
COMBINATORICS
1999
15 years 23 days ago
1999
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
118
Voted
EJC
2008
15 years 1 months ago
2008
Abstract. A pattern class is a set of permutations closed under pattern involvement or, equivalently, defined by certain subsequence avoidance conditions. Any pattern class X which...
COMBINATORICS
2006
15 years 1 months ago
2006
We prove that the set of permutations generated by a stack of depth two and an infinite stack in series has a basis (defining set of forbidden patterns) consisting of 20 permutati...
118
Voted
ISAAC
2009
Springer
15 years 7 months ago
2009
Springer
