相关论文: Limits of Modified Higher (q,t)-Catalan Numbers

We study the $(q,t)$-enumeration of triangular Dyck paths considered by Bergeron and Mazin. To do so, we introduce the notion of triangular and sim-sym tableaux and the deficit statistic which is a new interpretation of the dinv. We use it…

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…

Given a permutation $f$, we study the positroid Catalan number $C_f$ defined to be the torus-equivariant Euler characteristic of the associated open positroid variety. We introduce a class of repetition-free permutations and show that the…

We introduce the three-Catalan triangle, highlighting the three-Catalan numbers along with their recurrence relation and combinatorial interpretation, which allows us to establish their log-convexity. Additionally, we prove that the rows of…

We prove a central limit theorem for the joint distribution of $s_q(A_jn)$, $1\le j \le d$, where $s_q$ denotes the sum-of-digits function in base~$q$ and the $A_j$'s are positive integers relatively prime to $q$. We do this in fact within…

In The Delta Conjecture (arxiv:1509.07058), Haglund, Remmel and Wilson introduced a four variable $q,t,z,w$ Catalan polynomial, so named because the specialization of this polynomial at the values $(q,t,z,w) = (1,1,0,0)$ is equal to the…

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 classical $q$-analogue of the integers was recently generalized by Morier-Genoud and Ovsienko to give $q$-analogues of rational numbers. Some combinatorial interpretations are already known, namely as the rank generating functions for…

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

In this note, we explore certain determinantal descriptions of the Robbins numbers. Techniques used for this include continued fractions, Riordan arrays and series inversion. Proven and conjectured representations involve the determinants…

We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…

In this paper we shall survey the various methods of evaluating Hankel determinants and as an illustration we evaluate some Hankel determinants of a q-analogue of Catalan numbers. Here we consider $\frac{(aq;q)_{n}}{(abq^{2};q)_{n}}$ as a…

We show the classical $q$-Stirling numbers of the second kind can be expressed compactly as a pair of statistics on a subset of restricted growth words. The resulting expressions are polynomials in $q$ and $1+q$. We extend this enumerative…

In this work, we consider a class of substitutions on infinite alphabets and show that they exhibit a growth behaviour which is impossible for substitutions on finite alphabets. While for both settings the leading term of the tile counting…

Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last…

Following Benjamin et al., a matrix with entries being sums of two neighbouring Catalan numbers is considered. Its LU-decomposition is given, by guessing the results and later prove it by computer algebra, with lots of human help.…

We consider the problem of counting the set of $\mathscr{D}_{a,b}$ of Dyck paths inscribed in a rectangle of size $a\times b$. They are a natural generalization of the classical Dyck words enumerated by the Catalan numbers. By using Ferrers…

We will look at the Catalan numbers from the {\it Rigged Configurations} point of view originated \cite{Kir} from an combinatorial analysis of the Bethe Ansatz Equations associated with the higher spin anisotropic Heisenberg models . Our…

We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…

Given the growing quantity of proposals and works of basic hypergeometric functions in the scope of $q$-calculus, it is important to introduce a systematic classification of $q$-calculus. Our aim in this article is to investigate certain…