scholarly journals Limits of Modified Higher $q,t$-Catalan Numbers

10.37236/3201 ◽  
2013 ◽  
Vol 20 (3) ◽  
Author(s):  
Kyungyong Lee ◽  
Li Li ◽  
Nicholas A Loehr

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 eventually proved that all these definitions are equivalent. In this paper, we study the similar situation for higher $q,t$-Catalan numbers, where the equivalence of the algebraic and combinatorial definitions is still conjectural. We compute the limits of several versions of the modified higher $q,t$-Catalan numbers and show that these limits equal the generating function for integer partitions. We also identify certain coefficients of the higher $q,t$-Catalan numbers as enumerating suitable integer partitions, and we make some conjectures on the homological significance of the Bergeron-Garsia nabla operator.

10.37236/1709 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
E. S. Egge ◽  
J. Haglund ◽  
K. Killpatrick ◽  
D. Kremer

Garsia and Haiman (J. Algebraic. Combin. $\bf5$ $(1996)$, $191-244$) conjectured that a certain sum $C_n(q,t)$ of rational functions in $q,t$ reduces to a polynomial in $q,t$ with nonnegative integral coefficients. Haglund later discovered (Adv. Math., in press), and with Garsia proved (Proc. Nat. Acad. Sci. ${\bf98}$ $(2001)$, $4313-4316$) the refined conjecture $C_n(q,t) = \sum q^{{\rm area}}t^{{\rm bounce}}$. Here the sum is over all Catalan lattice paths and ${\rm area}$ and ${\rm bounce}$ have simple descriptions in terms of the path. In this article we give an extension of $({\rm area},{\rm bounce})$ to Schröder lattice paths, and introduce polynomials defined by summing $q^{{\rm area}}t^{{\rm bounce}}$ over certain sets of Schröder paths. We derive recurrences and special values for these polynomials, and conjecture they are symmetric in $q,t$. We also describe a much stronger conjecture involving rational functions in $q,t$ and the $\nabla$ operator from the theory of Macdonald symmetric functions.


2014 ◽  
Vol 23 (6) ◽  
pp. 1057-1086 ◽  
Author(s):  
PETER J. GRABNER ◽  
ARNOLD KNOPFMACHER ◽  
STEPHAN WAGNER

We consider statistical properties of random integer partitions. In order to compute means, variances and higher moments of various partition statistics, one often has to study generating functions of the form P(x)F(x), where P(x) is the generating function for the number of partitions. In this paper, we show how asymptotic expansions can be obtained in a quasi-automatic way from expansions of F(x) around x = 1, which parallels the classical singularity analysis of Flajolet and Odlyzko in many ways. Numerous examples from the literature, as well as some new statistics, are treated via this methodology. In addition, we show how to compute further terms in the asymptotic expansions of previously studied partition statistics.


10.37236/570 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Haijian Zhao ◽  
Zheyuan Zhong

We introduce a pair of statistics, maj and sh, on Dyck paths and show that they are equidistributed. Then we prove that this maj is equivalent to the statistics $ls$ and $rb$ on non-crossing partitions. Based on non-crossing partitions, we give the most obvious $q$-analogue of the Narayana numbers and the Catalan numbers.


2020 ◽  
Vol DMTCS Proceedings, 28th... ◽  
Author(s):  
Maciej Dolega ◽  
Valentin Féray

International audience Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series ψ(x, y, z; t, 1 + β) that might be interpreted as a continuous deformation of the rooted hypermap generating series. They made the following conjecture: coefficients of ψ(x, y, z; t, 1+β) are polynomials in β with nonnegative integer coefficients. We prove partially this conjecture, nowadays called b-conjecture, by showing that coefficients of ψ(x, y, z; t, 1 + β) are polynomials in β with rational coefficients. Until now, it was only known that they are rational functions of β. A key step of the proof is a strong factorization property of Jack polynomials when α → 0 that may be of independent interest.


10.37236/5085 ◽  
2016 ◽  
Vol 23 (1) ◽  
Author(s):  
Andrei L. Kanunnikov ◽  
Ekaterina A. Vassilieva

This article is devoted to the study of Jack connection coefficients, a generalization of the connection coefficients of the classical commutative subalgebras of the group algebra of the symmetric group closely related to the theory of Jack symmetric functions. First introduced by Goulden and Jackson (1996) these numbers indexed by three partitions of a given integer $n$ and the Jack parameter $\alpha$ are defined as the coefficients in the power sum expansion of some Cauchy sum for Jack symmetric functions. Goulden and Jackson conjectured that they are polynomials in $\beta = \alpha-1$ with non negative integer coefficients of combinatorial significance, the Matchings-Jack conjecture.In this paper we look at the case when two of the integer partitions are equal to the single part $(n)$. We use an algebraic framework of Lasalle (2008) for Jack symmetric functions and a bijective construction in order to show that the coefficients satisfy a simple recurrence formula and prove the Matchings-Jack conjecture in this case. Furthermore we exhibit the polynomial properties of more general coefficients where the two single part partitions are replaced by an arbitrary number of integer partitions either equal to $(n)$ or $[1^{n-2}2]$.


10.37236/664 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Guoce Xin ◽  
Jing-Feng Xu

We notice that two combinatorial interpretations of the well-known Catalan numbers $C_n=(2n)!/n!(n+1)!$ naturally give rise to a recursion for $C_n$. This recursion is ideal for the study of the congruences of $C_n$ modulo $2^r$, which attracted a lot of interest recently. We present short proofs of some known results, and improve Liu and Yeh's recent classification of $C_n$ modulo $2^r$. The equivalence $C_{n}\equiv_{2^r} C_{\bar n}$ is further reduced to $C_{n}\equiv_{2^r} C_{\tilde{n}}$ for simpler $\tilde{n}$. Moreover, by using connections between weighted Dyck paths and Motzkin paths, we find new classes of combinatorial sequences whose $2$-adic order is equal to that of $C_n$, which is one less than the sum of the digits of the binary expansion of $n+1$.


2018 ◽  
Vol 2 (2) ◽  
pp. 169-214
Author(s):  
Andrea Appel ◽  
Ilknur Egilmez ◽  
Matthew Hogancamp ◽  
Aaron Lauda

1991 ◽  
Vol s2-43 (3) ◽  
pp. 509-528 ◽  
Author(s):  
Ralph L. Cohen ◽  
Don H. Shimamoto

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Drew Armstrong

International audience In 2003, Haglund's bounce statistic gave the first combinatorial interpretation of the q,t-Catalan numbers and the Hilbert series of diagonal harmonics. In this paper we propose a new combinatorial interpretation in terms of the affine Weyl group of type A. In particular, we define two statistics on affine permutations; one in terms of the Shi hyperplane arrangement, and one in terms of a new arrangement — which we call the Ish arrangement. We prove that our statistics are equivalent to the area' and bounce statistics of Haglund and Loehr. In this setting, we observe that bounce is naturally expressed as a statistic on the root lattice. We extend our statistics in two directions: to "extended'' Shi arrangements and to the bounded chambers of these arrangements. This leads to a (conjectural) combinatorial interpretation for all integral powers of the Bergeron-Garsia nabla operator applied to elementary symmetric functions. En 2003, la statistique bounce de Haglund a donné la première interprétation combinatoire de la somme des nombres q,t-Catalan et de la série de Hilbert des harmoniques diagonaux. Dans cet article nous proposons une nouvelle interprétation combinatoire à partir du groupe de Weyl affine de type A. En particulier, nous définissons deux statistiques sur les permutations affines; l'une à partir de l'arrangement d'hyperplans Shi, et l'autre à partir d'un nouvel arrangement — que nous appelons l'arrangement Ish. Nous prouvons que nos statistiques sont équivalentes aux statistiques area' et bounce de Haglund et Loehr. Dans ce contexte, nous observons que bounce s'exprime naturellement comme une statistique sur le réseau des racines. Nous prolongeons nos statistiques dans deux directions: arrangements Shi "étendus'', et chambres bornées associées. Cela conduit à une interprétation (conjecturale) combinatoire pour toutes les puissances entières de l'opérateur nabla de Bergeron-Garsia appliqué aux fonctions symétriques élémentaires.


10.37236/946 ◽  
2007 ◽  
Vol 14 (1) ◽  
Author(s):  
David Callan

The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle structure is amenable to complete analysis. In particular, each cycle has length a power of 2. A new manifestation of the Catalan numbers as labeled forests crops up en route as does the Pascal matrix mod 2. We use the bijection to show the equivalence of two known manifestations of the Motzkin numbers. Finally, we consider some statistics on the new Catalan manifestation and the identities they interpret.


Sign in / Sign up

Export Citation Format

Share Document