A permutation is an arrangement of a finite number of distinct elements of a linear order, for example, e, Ï€, 0, âˆš 2 and 3412. Two permutations are order isomorphic if the have the same relativeâ€¦ (More)

We say a permutation Ï€ contains or involves the permutation Ïƒ if deleting some of the entries of Ï€ gives a permutation that is order isomorphic to Ïƒ, and we write Ïƒ Â¤ Ï€. For example, 534162 containsâ€¦ (More)

In general, the profile class of a 0/Â±1 matrix M contains all permutations that can be divided in a prescribed manner (dictated by M) into a finite number of monotonic blocks. For example,â€¦ (More)

Patience Sorting is a combinatorial algorithm that can be viewed as an iterated, non-recursive form of the Schensted Insertion Algorithm. In recent work the authors have shown that the basicâ€¦ (More)

s of Conferences in Honor of Doron Zeilbergerâ€™s 60th Birthday Communicated by Aaron Robertson and Vince Vatter (for Rutgers), Gizel Maimon (for Weizmann), and Qing-Hu Hou (for Nankai) From A=B toâ€¦ (More)

A permutation in S n , from the viewpoint of permutation patterns, can be described as a pair of linear orders on the set {1, 2, . . . , n}. Thus the study of permutation patterns can thus be viewedâ€¦ (More)

A permutation is an arrangement of a finite number of distinct elements of a linear order, for example, e, Ï€, 0, âˆš 2 and 3412. Two permutations are order isomorphic if the have the same relativeâ€¦ (More)