اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPlaying jeu de taquin on d-complete posets
133
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Using a modified version of jeu de taquin, Novelli, Pak and Stoyanovskii gave a bijective proof of the hook-length formula for counting standard Young tableaux of fixed shape. In this paper we consider a natural extension of jeu de taquin to arbitrary posets. Given a poset P, jeu de taquin defines a map from the set of bijective labelings of the poset elements with ${1,2,...,|P|}$ to the set of linear extensions of the poset. One question of particular interest is for which posets this map yields each linear extension equally often. We analyze the double-tailed diamond poset $D_{m,n}$ and show that uniform distribution is obtained if and only if $D_{m,n}$ is d-complete. Furthermore, we observe that the extended hook-length formula for counting linear extensions on d-complete posets provides a combinatorial answer to a seemingly unrelated question, namely: Given a uniformly random standard Young tableau of fixed shape, what is the expected value of the left-most entry in the second row?
قيم البحث
اقرأ أيضاً
We give a necessary and sufficient condition for a $P_4$-free graph to be a cograph. This allows us to obtain a simple proof of the fact that finite $P_4$-free graphs are finite cographs. We also prove that chain complete posets whose comparability graph is a cograph are series-parallel.
Motivated by generalizing Khovanovs categorification of the Jones polynomial, we study functors $F$ from thin posets $P$ to abelian categories $mathcal{A}$. Such functors $F$ produce cohomology theories $H^*(P,mathcal{A},F)$. We find that CW posets,
that is, face posets of regular CW complexes, satisfy conditions making them particularly suitable for the construction of such cohomology theories. We consider a category of tuples $(P,mathcal{A},F,c)$, where $c$ is a certain ${1,-1}$-coloring of the cover relations in $P$, and show the cohomology arising from a tuple $(P,mathcal{A},F,c)$ is functorial, and independent of the coloring $c$ up to natural isomorphism. Such a construction provides a framework for the categorification of a variety of familiar topological/combinatorial invariants: anything expressible as a rank-alternating sum over a thin poset.
We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.
In this paper, we show that, for all $ngeq 5$, the maximum number of $2$-chains in a butterfly-free family in the $n$-dimensional Boolean lattice is $leftlceilfrac{n}{2}rightrceilbinom{n}{lfloor n/2rfloor}$. In addition, for the height-2 poset $K_{
s,t}$, we show that, for fixed $s$ and $t$, a $K_{s,t}$-free family in the $n$-dimensional Boolean lattice has $Oleft(nbinom{n}{lfloor n/2rfloor}right)$ $2$-chains.
For any graded poset $P$, we define a new graded poset, $mathcal E(P)$, whose elements are the edges in the Hasse diagram of P. For any group, $G$, acting on the boolean algebra, $B_n$, we conjecture that $mathcal E(B_n/G)$ is Peck. We prove that the
conjecture holds for common cover transitive actions. We give some infinite families of common cover transitive actions and show that the common cover transitive actions are closed under direct and semidirect products.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
