ترغب بنشر مسار تعليمي؟ اضغط هنا

On the Sign-imbalance of Permutation Tableaux

80   0   0.0 ( 0 )
 نشر من قبل Chen Na Joanna
 تاريخ النشر 2016
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

Permutation tableaux were introduced by Steingr{i}msson and Williams. Corteel and Kim defined the sign of a permutation tableau in terms of the number of unrestricted columns. The sign-imbalance of permutation tableaux of length $n$ is the sum of signs over permutation tableaux of length $n$. They have btained a formula for the sign-imbalance of permutation tableaux of length $n$ by using generating functions and asked for a combinatorial proof. Moreover, they raised the question of finding a sign-imbalance formula for type $B$ permutation tableaux introduced by Lam and Williams. We define a statistic $ wnm$ over permutations and show that the number of unrestricted columns over permutation tableaux of length $n$ is equally distributed with $ wnm$ over permutations of length $n$. This leads to a combinatorial interpretation of the formula of Corteel and Kim. For type $B$ permutation tableaux, we define the sign of a type $B$ permutation tableau in term of the number of certain rows and columns. On the other hand, we construct a bijection between the type $B$ permutation tableaux of length $n$ and symmetric permutations of length $2n$ and we show that the statistic $ wnm$ over symmetric permutations of length $2n$ is equally distributed with the number of certain rows and columns over type $B$ permutation tableaux of length $n$. Based on this correspondence and an involution on symmetric permutation of length $2n$, we obtain a sign-imbalance formula for type $B$ permutation tableaux.



قيم البحث

اقرأ أيضاً

94 - Joanna N. Chen 2021
Permutation statistics $wnm$ and $rlm$ are both arising from permutation tableaux. $wnm$ was introduced by Chen and Zhou, which was proved equally distributed with the number of unrestricted rows of a permutation tableau. While $rlm$ is showed by Nad eau equally distributed with the number of $1$s in the first row of a permutation tableau. In this paper, we investigate the joint distribution of $wnm$ and $rlm$. Statistic $(rlm,wnm,rlmin,des,(underline{321}))$ is shown equally distributed with $(rlm,rlmin,wnm,des,(underline{321}))$ on $S_n$. Then the generating function of $(rlm,wnm)$ follows. An involution is constructed to explain the symmetric property of the generating function. Also, we study the triple statistic $(wnm,rlm,asc)$, which is shown to be equally distributed with $(rlmax-1,rlmin,asc)$ as studied by Josuat-Verg$grave{e}$s. The main method we adopt throughout the paper is constructing bijections based on a block decomposition of permutations.
84 - Seung Jin Lee 2019
In 1976, King defined certain tableaux model, called King tableaux in this paper, counting weight multiplicities of irreducible representation of the symplectic group $Sp(2m)$ for a given dominant weight. Since Kashiwara defined crystals, it is an op en problem to provide a crystal structure on King tableaux. In this paper, we present crystal structures on King tableaux and semistandard oscillating tableaux. The semistandard oscillating tableaux naturally appear as $Q$-tableaux in the symplectic version of RSK algorithms. As an application, we discuss Littlewood-Richardson coefficients for $Sp(2m)$ in terms of semistandard oscillating tableaux.
193 - Sen-Peng Eu 2010
Let $mathcal{T}_3$ be the three-rowed strip. Recently Regev conjectured that the number of standard Young tableaux with $n-3$ entries in the skew three-rowed strip $mathcal{T}_3 / (2,1,0)$ is $m_{n-1}-m_{n-3}$, a difference of two Motzkin numbers. Th is conjecture, together with hundreds of similar identities, were derived automatically and proved rigorously by Zeilberger via his powerful program and WZ method. It appears that each one is a linear combination of Motzkin numbers with constant coefficients. In this paper we will introduce a simple bijection between Motzkin paths and standard Young tableaux with at most three rows. With this bijection we answer Zeilbergers question affirmatively that there is a uniform way to construct bijective proofs for all of those identites.
This paper completely characterizes the standard Young tableaux that can be reconstructed from their sets or multisets of $1$-minors. In particular, any standard Young tableau with at least $5$ entries can be reconstructed from its set of $1$-minors.
376 - Peter Clifford 2003
Motivated by Stanleys results in cite{St02}, we generalize the rank of a partition $lambda$ to the rank of a shifted partition $S(lambda)$. We show that the number of bars required in a minimal bar tableau of $S(lambda)$ is max$(o, e + (ell(lambda) m athrm{mod} 2))$, where $o$ and $e$ are the number of odd and even rows of $lambda$. As a consequence we show that the irreducible projective characters of $S_n$ vanish on certain conjugacy classes. Another corollary is a lower bound on the degree of the terms in the expansion of Schurs $Q_{lambda}$ symmetric functions in terms of the power sum symmetric functions.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا