Refined Restricted Permutations Avoiding Subsets of Patterns of Length Three.

Item request has been placed!

Item request cannot be made.

Processing Request

اقرأ على الانترنت اقرأ أكثر حفظ في قائمتي

المؤلفون: Mansour, Toufik; Robertson, Aaron
المصدر:
Annals of Combinatorics; 2002, Vol. 6 Issue 3/4, p407, 12p
الموضوع:
PERMUTATIONS; COMBINATORICS; SET theory; MATHEMATICS; MATHEMATICAL logic

معلومة اضافية
- نبذة مختصرة :
  Define$ S \limits_{n}^{k} (T) $$*FORMULAINSPRINGER$ to be the set of permutations of {1,2,...,n} with exactly k fixed points which avoid all patterns in$ T \subseteq S_m $$*FORMULAINSPRINGER$. We enumerate [ABSTRACT FROM AUTHOR]
- نبذة مختصرة :
  Copyright of Annals of Combinatorics is the property of Springer Nature and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)