English
Related papers

Related papers: Recursions for rational q,t-Catalan numbers

200 papers

The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

In this (mostly expository) paper I want to share some observations prompted by a class of matrices whose determinants are Catalan numbers. Considering different methods of proof we obtain some generalizations and q-analogues and…

Combinatorics · Mathematics 2019-05-03 Johann Cigler

We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…

Combinatorics · Mathematics 2007-05-23 Emeric Deutsch , Bruce E. Sagan

We conjecture a formula for the rational $q,t$-Catalan polynomial $\mathcal{C}_{r/s}$ that is symmetric in $q$ and $t$ by definition. The conjecture posits that $\mathcal{C}_{r/s}$ can be written in terms of symmetric monomial strings…

Combinatorics · Mathematics 2024-12-31 Graham Hawkes

A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.

Combinatorics · Mathematics 2007-05-23 Siu-Ah Ng

Let $I$ be the ideal generated by alternating polynomials in two sets of $n$ variables. Haiman proved that the $q,t$-Catalan number is the Hilbert series of the graded vector space $M(=\bigoplus_{d_1,d_2}M_{d_1,d_2})$ spanned by a minimal…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li

The Raney numbers $R_{p,r}(k)$ are a two-parameter generalization of the Catalan numbers. In this paper, we obtain a recurrence relation for the Raney numbers which is a generalization of the recurrence relation for the Catalan numbers.…

Combinatorics · Mathematics 2015-12-29 Robin DaPao Zhou

We use a generalized Lambert series identity due to the first author to present q-series proofs of recent results of Imamoglu, Raum and Richter concerning recursive formulas for the coefficients of two 3rd order mock theta functions.…

Number Theory · Mathematics 2021-02-04 Song Heng Chan , Renrong Mao , Robert Osburn

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q=1, to the Catalan numbers: 1, 1, 2, 5, 14,..., a log-convex sequence. We use a combinatorial interpretation of…

Combinatorics · Mathematics 2007-05-23 L. M. Butler , W. P. Flanigan

This paper is essentially devoted to the study of some interesting relations among the well known operators $I^{(x)}$ (the interpolated Invert), $L^{(x)}$ (the interpolated Binomial) and Revert (that we call $\eta$). We prove that $I^{(x)}$…

Number Theory · Mathematics 2011-02-22 Stefano Barbero , Umberto Cerruti

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

The binomial coefficients and Catalan triangle numbers appear as weight multiplicities of the finite-dimensional simple Lie algebras and affine Kac--Moody algebras. We prove that any binomial coefficient can be written as weighted sums…

Combinatorics · Mathematics 2017-10-18 Kyu-Hwan Lee , Se-jin Oh

This paper provides the connection between the Hankel transform and aerating transforms of a given integer sequence. Results obtained are used to establish a completely different Hankel transform evaluation of the series reversion of a…

Combinatorics · Mathematics 2011-12-08 Radica Bojičić , Marko D. Petković , Paul Barry

We conjecturally extract the triply graded Khovanov-Rozansky homology of the (m, n) torus knot from the unique finite dimensional simple representation of the rational DAHA of type A, rank n - 1, and central character m/n. The conjectural…

Representation Theory · Mathematics 2015-01-14 Eugene Gorsky , Alexei Oblomkov , Jacob Rasmussen , Vivek Shende

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…

Combinatorics · Mathematics 2015-10-14 Ryan Kaliszewski , Huilan Li

Suppose $M$ and $N$ are positive integers and let $k = \gcd(M, N)$, $m = M/k$, and $n=N/k$. We define a symmetric function $L_{M,N}$ as a weighted sum over certain tuples of lattice paths. We show that $L_{M,N}$ satisfies a generalization…

Combinatorics · Mathematics 2022-06-02 Andy Wilson

We consider a large class of $q$-series that have the structure of Nahm sums, or equivalently motivic generating series for quivers. First, we initiate a systematic analysis and classification of classical and quantum A-polynomials…

High Energy Physics - Theory · Physics 2020-08-26 Helder Larraguivel , Dmitry Noshchenko , Miłosz Panfil , Piotr Sułkowski

Motivated by a formula of A. Postnikov relating binary trees, we define the hook length polynomials for m-ary trees and plane forests, and show that these polynomials have a simple binomial expression. An integer value of this expression is…

Combinatorics · Mathematics 2007-05-23 Rosena R. X. Du , Fu Liu

A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms. These objects are enumerated by the well-known Catalan numbers, and have been introduced with the aim of giving a common language to most of the structures…

Discrete Mathematics · Computer Science 2010-11-17 Stefano Bilotta , Filippo Disanto , Renzo Pinzani , Simone Rinaldi

For $m,n$ coprime we introduce a new statistic skip on $(m,n)$-rational Dyck paths and give a fast way to compute dinv and skip statistics. We also introduce $(m,n)$-rank words, which are in one-to-one correspondence with $(m,n)$-Dyck…

Combinatorics · Mathematics 2016-11-16 Ryan Kaliszewski , Huilan Li