Rook placements in Young diagrams and permutation enumeration
نویسندگان
چکیده
منابع مشابه
Rook Placements in Young Diagrams and Permutation Enumeration
Abstract. Given two operators M and N subject to the relation MN −qNM = p, and a word w in M and N , the rewriting of w in normal form is combinatorially described by rook placements in a Young diagram. We give enumerative results about these rook placements, particularly in the case where p = (1−q)/q. This case naturally arises in the context of the PASEP, a random process whose partition func...
متن کاملm-Level rook placements
Goldman, Joichi, and White proved a beautiful theorem showing that the falling factorial generating function for the rook numbers of a Ferrers board factors over the integers. Briggs and Remmel studied an analogue of rook placements where rows are replaced by sets of m rows called levels. They proved a version of the factorization theorem in that setting, but only for certain Ferrers boards. We...
متن کاملPattern Avoiding Permutations & Rook Placements
First, we look at the distribution of permutation statistics in the context of pattern-avoiding permutations. The first part of this chapter deals with a recursively defined bijection of Robertson [6] between 123and 132-avoiding permutations. We introduce the general notion of permutation templates and pivots in order to give a non-recursive pictorial reformulation of Robertson’s bijection. Thi...
متن کاملPatterns in matchings and rook placements
Extending the notion of pattern avoidance in permutations, we study matchings and set partitions whose arc diagram representation avoids a given configuration of three arcs. These configurations, which generalize 3-crossings and 3-nestings, have an interpretation, in the case of matchings, in terms of patterns in full rook placements on Ferrers boards. We enumerate 312-avoiding matchings and pa...
متن کاملThe Permutation Group and Young Diagrams
The permutation, or symmetric, group, Sn is interesting at least partly because it contains subgroups isomorphic to all groups of order ≤ n. This result is known as “Cayley’s theorem”. It is also of great value in tensor analysis as the means to describe the tensor space in terms of symmetries under permutations of indicies. Here, we develop a diagrammatic approach to determining the irreducibl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2011
ISSN: 0196-8858
DOI: 10.1016/j.aam.2010.04.003