465 research outputs found
Standard Young Tableaux and Colored Motzkin Paths
In this paper, we propose a notion of colored Motzkin paths and establish a
bijection between the -cell standard Young tableaux (SYT) of bounded height
and the colored Motzkin paths of length . This result not only gives a
lattice path interpretation of the standard Young tableaux but also reveals an
unexpected intrinsic relation between the set of SYTs with at most rows
and the set of SYTs with at most 2d rows.Comment: 21 page
On -Counting of Noncrossing Chains and Parking Functions
For a finite Coxeter group , Josuat-Verg\`es derived a -polynomial
counting the maximal chains in the lattice of noncrossing partitions of by
weighting some of the covering relations, which we call bad edges, in these
chains with a parameter . We study the connection of these weighted chains
with parking functions of type (, respectively) from the perspective of
the -polynomial. The -polynomial turns out to be the generating function
for parking functions (of either type) with respect to the number of cars that
do not park at their preferred spaces. In either case, we present a bijective
result that carries bad edges to unlucky cars while preserving their relative
order. Using this, we give an interpretation of the -positivity of the
-polynomial in the case that is the hyperoctahedral group.Comment: 32 pages, to be published in SIDM
- …