72 search results - page 4 / 15 » Permutations Avoiding Two Patterns of Length Three |
COMBINATORICS
2002
14 years 11 months ago
2002
Let In() denote the number of involutions in the symmetric group Sn which avoid the permutation . We say that two permutations , Sj may be exchanged if for every n, k, and order...
COMBINATORICS
2006
14 years 11 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...
107
click to vote
EJC
2008
14 years 12 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...
104
click to vote
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In interference-limited wireless cellular systems, interference avoidance and interference averaging are widely adopted to combat co-channel interference. In different types of...
CPM
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...