Related papers: Combinatorial study of the q-Catalan triangle and …

Let F* be the finite field of q elements and let P(n,q) be the projective space of dimension n-1 over F*. We construct a family H^{n}_{k,i} of combinatorial homology modules associated to P(n,q) over a coefficient field F field of…

We use the method of tiling to give elementary combinatorial proofs of some celebrated $q$-series identities, such as Jacobi triple product identity, Rogers-Ramanujan identities, and some identities of Rogers. We give a tiling proof of the…

Let $n,k,$ and $r$ be nonnegative integers and let $S_n$ be the symmetric group. We introduce a quotient $R_{n,k,r}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which carries the structure of a graded $S_n$-module.…

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

A polynomial $A(q)=\sum_{i=0}^n a_iq^i$ is said to be unimodal if $a_0\le a_1\le \cdots \le a_k\ge a_{k+1} \ge \cdots \ge a_n$. We investigate the unimodality of rational $q$-Catalan polynomials, which is defined to be $C_{m,n}(q)=…

In type A, the q,t-Fuss -Catalan numbers can be defined as a bigraded Hilbert series of a module associated to the symmetric group S_n. We generalize this construction to (finite) complex reflection groups and exhibit some nice conjectured…

We present new proofs and generalizations of unimodality of the q-binomial coefficients \binom{n}{k}_q as polynomials in q. We use an algebraic approach by interpreting the differences between numbers of certain partitions as Kronecker…

By making use of the multiplicate form of the extended Carlitz inverse series relations, we establish two general `dual' theorems of Jackson's summation formula for well--poised $_8\phi_7$-series. Their duplicate forms under the partition…

In this paper, we consider the new family of recurrence sequences of $(q,k)$-generalized Fibonacci numbers. These sequences naturally extend the well-known sequences of $k$-generalized Fibonacci numbers and generalized $k$-order Pell…

Let $n\geq2$ be an integer. In this paper, we study the convexity of the so-called MacMahon's $q$-Catalan polynomials $C_n(q)=\frac1{[n+1]_q}\left[ 2n \atop n \right]_q$ as functions of $q$. Along the way, several intermediate results on…

Path pairs are a modification of parallelogram polyominoes that provide yet another combinatorial interpretation of the Catalan numbers. More generally, the number of path pairs of length $n$ and distance $\delta$ corresponds to the…

We give a simple recursion labeled by binary sequences which computes rational $q,t$-Catalan power series, both in relatively prime and non relatively prime cases. It is inspired by, but not identical to recursions due to B. Elias, M.…

We describe one interpretation of the q-Catalan numbers in frameworks of random matrix theory and weighted partitions of the set of integers.

$q$-analogues of quantities in mathematics involve perturbations of classical quantities using the parameter $q$, and revert to the original quantities when $q$ goes $1$. An important example is the $q$-analogues of binomial coefficients…

The q-binomial coefficients were assumed to be unimodal as early as the 1850's, but it remained unproven until Sylvester's 1878 proof using invariant theory. In 1982, Proctor gave an "elementary" proof using linear algebra. Finally, in…

The $(q,r)$-Whitney numbers were recently defined in terms of the $q$-Boson operators, and several combinatorial properties which appear to be $q$-analogues of similar properties were studied. In this paper, we obtain elementary and…

We begin by deriving a number of combinatorial identities satisfied by the $q$-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the $q$-super Catalan numbers. Next,…

We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area,skip,dinv) are given, we have an algorithm to construct…

For $0\leq k \leq n$, the number $C(n,k)$ represents the number of all lattice paths in the plane from the point $(0,0)$ to the point $(n,k)$, using steps $(1,0)$ and $(0,1)$, that never rise above the main diagonal $y=x$. The Fuss-Catalan…

Using the combinatorial formula for the transformed Macdonald polynomials of Haglund, Haiman, and Loehr, we investigate the combinatorics of the symmetry relation $\widetilde{H}_\mu(\mathbf{x};q,t) =…