اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn the three-rowed skew standard Young tableaux
201
0
0.0
(
0
)
تأليف
Sen-Peng Eu
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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. This 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.
قيم البحث
اقرأ أيضاً
In this paper, we propose a notion of colored Motzkin paths and establish a bijection between the $n$-cell standard Young tableaux (SYT) of bounded height and the colored Motzkin paths of length $n$. This result not only gives a lattice path interpre
tation of the standard Young tableaux but also reveals an unexpected intrinsic relation between the set of SYTs with at most $2d+1$ rows and the set of SYTs with at most 2d rows.
We show that J_n, the Stanley-Reisner ideal of the n-cycle, has a free resolution supported on the (n-3)-dimensional simplicial associahedron A_n. This resolution is not minimal for n > 5; in this case the Betti numbers of J_n are strictly smaller th
an the f-vector of A_n. We show that in fact the Betti numbers of J_n are in bijection with the number of standard Young tableaux of shape (d+1, 2, 1^{n-d-3}). This complements the fact that the number of (d-1)-dimensional faces of A_n are given by the number of standard Young tableaux of (super)shape (d+1, d+1, 1^{n-d-3}); a bijective proof of this result was first provided by Stanley. An application of discrete Morse theory yields a cellular resolution of J_n that we show is minimal at the first syzygy. We furthermore exhibit a simple involution on the set of associahedron tableaux with fixed points given by the Betti tableaux, suggesting a Morse matching and in particular a poset structure on these objects.
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.
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.
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 sig
ns 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
