Polygon dissections and standard Young tableaux
From MaRDI portal
Publication:1924248
DOI10.1006/jcta.1996.0099zbMath0859.05075OpenAlexW2035311609MaRDI QIDQ1924248
Publication date: 7 April 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/43b2c3e92d1542f5d6072e404a954de8952615bf
Related Items
A combinatorial formula for Kazhdan-Lusztig polynomials of sparse paving matroids, The cyclic sieving phenomenon, Face rings of cycles, associahedra, and standard Young tableaux, A web basis of invariant polynomials from noncrossing partitions, Counting quiddities of polygon dissections, A combinatorial formula for of \(\rho\)-removed uniform matroids, Nested sets, set partitions and Kirkman-Cayley dissection numbers, Cyclic sieving of increasing tableaux and small Schröder paths, Parking spaces., The sandpile model on the complete split graph, Motzkin words, and tiered parking functions, Enumeration on row-increasing tableaux of shape \(2 \times n\), Colored partitions of a convex polygon by noncrossing diagonals, A skein action of the symmetric group on noncrossing partitions, Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm, Minimal permutations with \(d\) descents, Minimal permutations and 2-regular skew tableaux, A web basis of invariant polynomials from noncrossing partitions, Some Properties and Combinatorial Implications of Weighted Small Schr\"oder Numbers, From Dyck paths to standard Young tableaux, Polygon dissections and Euler, Fuss, Kirkman, and Cayley numbers, Toric varieties of Schröder type
