相关论文: Unimodality of $q$-Fibonomial coefficients for sma…
Let $\Phi_n(q)$ be the $n$-th cyclotomic polynomial in $q$. Recently, the author and Zudilin provide a creative microscoping method to prove some $q$-supercongruences mainly modulo $\Phi_n(q)^3$ by introducing an additional parameter $a$.…
For a polynomial with palindromic coefficients, unimodality is equivalent to having a nonnegative $g$-vector. A sufficient condition for unimodality is having a nonnegative $\gamma$-vector, though one can have negative entries in the…
The $q$-analogue of the binomial coefficient, known as a $q$-binomial coefficient, is typically denoted $\left[{n \atop k}\right]_q$. These polynomials are important combinatorial objects, often appearing in generating functions related to…
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…
In a previous paper, we studied an overpartition analogue of Gaussian polynomials as the generating function for overpartitions fitting inside an $m \times n$ rectangle. Here, we add one more parameter counting the number of overlined…
We give "hybrid" proofs of the $q$-binomial theorem and other identities. The proofs are "hybrid" in the sense that we use partition arguments to prove a restricted version of the theorem, and then use analytic methods (in the form of the…
The $q$-binomial coefficients are q-analogues of the binomial coefficients, counting the number of $k$-dimensional subspaces in the $n$-dimensional vector space $\mathbb{F}^n_q$ over $\mathbb{F}_{q}$. In this paper, we define a Euclidean…
We establish a congruence on sums of central $q$-binomial coefficients. From this $q$-congruence, we derive the divisibility of the $q$-trinomial coefficients introduced by Andrews and Baxter.
In this paper, we introduce a combinatorial path model of representation of the quantum affine algebra of type $D_n$, inspired by Mukhin and Young's combinatorial path models of representations of the quantum affine algebras of types $A_n$…
We find a $q$-analog of the following symmetrical identity involving binomial coefficients $\binom{n}{m}$ and Eulerian numbers $A_{n,m}$, due to Chung, Graham and Knuth [{\it J. Comb.}, {\bf 1} (2010), 29--38]: {equation*} \sum_{k\geq…
Let $Q_n(z)$ be the polynomials associated with the Nekrasov-Okounkov formula $$\sum_{n\geq 1} Q_n(z) q^n := \prod_{m = 1}^\infty (1 - q^m)^{-z - 1}.$$ In this paper we partially answer a conjecture of Heim and Neuhauser, which asks if…
Connected the generalized Goncharov polynomials associated to a pair ($\partial,\mathcal{Z}$) if a delta operator $\partial$ and an interpolation grid $\mathcal{Z}$, introduced by Lorentz, Tringali and Yan in [7], with the theory of…
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…
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…
In this paper, we study the binomial sum $S_{n}(q):=% \overset{n}{\underset{k=0}{\sum }}a_{k}\binom{n}{k}\left( 1-q\right) ^{k}q^{n-k}$ for a given sequence $\left( a_{n}\right) $ of real or complex numbers. We express $S_{n}(q)$ in…
We use $q$-binomial theorem to prove three new polynomial identities involving $q$-trinomial coefficients. We then use summation formulas for the $q$-trinomial coefficients to convert our identities into another set of three polynomial…
We obtain connection coefficients between $q$-binomial and $q$-trinomial coefficients. Using these, one can transform $q$-binomial identities into a $q$-trinomial identities and back again. To demonstrate the usefulness of this procedure we…
We study divisibility for the $q$-trinomial coefficients $\tau_0(n,m,q)$, $T_0(n,m,q)$ and $T_1(n,m,q)$, which were first introduced by Andrews and Baxter. In particular, we completely determine $\tau_0(an,bn,q)$, $T_0(an,bn,q)$ and…
In 1920, MacMahon introduced two families of $q$-series to study divisor sums. Recent work has shown that MacMahon's $q$-series are closely connected to overpartitions and $3$-colored partitions. Merca introduced truncated forms of…
We show how lattice paths and the reflection principle can be used to give easy proofs of unimodality results. In particular, we give a "one-line" combinatorial proof of the unimodality of the binomial coefficients. Other examples include…