Related papers: Set-Valued Catalan Combinatorics

We give explicit formulas for the recently introduced Schur multiple zeta values, which generalize multiple zeta(-star) values and which assign to a Young tableaux a real number. In this note we consider Young tableaux of various shapes,…

The Catalan numbers form a sequence that counts over 200 combinatorial objects. A remarkable property of the Catalan numbers, which extends to these objects, is its recursive definition; that is, we can determine the $n^{th}$ object from…

Let $\delta=(\delta_1,\ldots,\delta_n)$ be a string of letters $h$ and $v$. We define a Young tableau to be $\delta$-semistandard if the entries are weakly increasing along rows and columns, and the entries $i$ form a horizontal strip if…

Let $g_{n_1,n_2}$ be the number of standard Young tableau of truncated shifted shape with $n_1$ rows and $n_2$ boxes in each row. By using of the integral method this paper derives the recurrence relations of $g_{3,n}$, $g_{n,4}$ and…

We study vectors formed by entries on the diagonal of standard Young tableaux of shifted shapes. Such vectors are in bijection with integer lattice points of certain integral polytopes, which are Minkowski sums of simplices. We also…

We define new generalizations of (q,t)-Catalan numbers applying nabla operator on k-Schur functions indexed by column partitions. In some special cases, we give a combinatorial interpretation of these numbers using configurations of Dyck…

Recently the authors introduced lecture hall tableaux in their study of multivariate little $q$-Jacobi polynomials. In this paper, we enumerate bounded lecture hall tableaux. We show that their enumeration is closely related to standard and…

This article introduces and investigates a refinement of alternating sign trapezoids by means of Catalan objects and Motzkin paths. Alternating sign trapezoids are a generalisation of alternating sign triangles, which were recently…

Given a partition $\lambda$ of a number $k$, it is known that by adding a long line of length $n-k$, the dimension of the associated representation of $S_{n}$ is an integer-valued polynomial of degree $k$ in $n$. We show that its expansion…

In this paper, we present an involution on some kind of colored $k$-ary trees which provides a combinatorial proof of a combinatorial sum involving the generalized Catalan numbers $C_{k,\gamma}(n)=\frac{\gamma}{k n+\gamma}{k n+\gamma\choose…

We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…

The representation theory of the symmetric groups S_n is intimately related to combinatorics: combinatorial objects such as Young tableaux and combinatorial algorithms such as Murnaghan-Nakayama rule. In the limit as n tends to infinity,…

For each pair of coprime integers $a$ and $b$ we have a rational $q$-Catalan number $\operatorname{Cat}(a,b)_q=\binom{a+b}{a}_q/[a+b]_q$. It is known that this is a polynomial in $q$ with nonnegative integer coefficients, but the nature of…

This is the third paper in the series. Here we define a few combinatorial orders on Young tableaux. The first order is obtained from induced Duflo order by the extension with the help of Vogan T_{\alpha, \beta} procedure. We call it…

In this paper, we enumerate lattice paths with certain constraints and apply the corresponding results to develop formulas for calculating the dimensions of submodules of a class of modules for planar upper triangular rook monoids. In…

We answer a question of Simental by providing a combinatorial interpretation of a formula which generalizes rational Catalan numbers and which appears in the study of Springer fibers. We provide an interpretation in terms of binary…

This paper concerns a relatively new combinatorial structure called staircase tableaux. They were introduced in the context of the asymmetric exclusion process and Askey--Wilson polynomials, however, their purely combinatorial properties…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

Catalan numbers $C(n)=\frac{1}{n+1}{2n\choose n}$ enumerate binary trees and Dyck paths. The distribution of paths with respect to their number $k$ of factors is given by ballot numbers $B(n,k)=\frac{n-k}{n+k}{n+k\choose n}$. These integers…

In this note we introduce a determinant and then give its evaluating formula. The determinant turns out to be a generalization of the well-known ballot and Fuss-Catalan numbers, which is believed to be new. The evaluating formula is proved…