q-Catalan Numbers
نویسندگان
چکیده
q-analogs of the Catalan numbers c', = (I/(n + I))($) are studied from the viewpoint of Lagrange inversion. The first, due to Carhtz, corresponds to the Andrews-Gessel-Garsia q-Lagrange inversion theory, satisfies a nice recurrence relation and counts inversions of Catalan words. The second, tracing back to Mac Mahon, arise from Krattenthaler's and Gessel and Stanton's q-Lagrange inversion formula, have a nice explicit formula and enumerate the major index. Finally a joint generalization is given which includes also the Polya-Gessel q-Catalan numbers.
منابع مشابه
The Limiting Distribution of the Coefficients of the q-Catalan Numbers
We show that the limiting distributions of the coefficients of the qCatalan numbers and the generalized q-Catalan numbers are normal. Despite the fact that these coefficients are not unimodal for small n, we conjecture that for sufficiently large n, the coefficients are unimodal and even log-concave except for a few terms of the head and tail. Introduction The main objective of this paper is to...
متن کامل-Catalan Numbers and Squarefree Binomial Coefficients
In this paper we consider the generalized Catalan numbers F (s, n) = 1 (s−1)n+1 ( sn n ) , which we call s-Catalan numbers. We find all natural numbers n such that for p prime, p divides F (p, n), q ≥ 1 and all distinct residues of F (p, n) (mod p), q = 1, 2. As a byproduct we settle a question of Hough and the late Simion on the divisibility of the 4-Catalan numbers by 4. We also prove that ( ...
متن کاملq-Analogs of some congruences involving Catalan numbers
We provide some variations on the Greene-Krammer's identity which involve q-Catalan numbers. Our method reveals a curious analogy between these new identities and some congruences modulo a prime.
متن کاملDivisibility of generalized Catalan numbers
We define a q generalization of weighted Catalan numbers studied by Postnikov and Sagan, and prove a result on the divisibility by p of such numbers when p is a prime and q its power.
متن کاملCoincidences of Catalan and Q-catalan Numbers
Let Cn and Cn(q) be the nth Catalan number and the nth q-Catalan number, respectively. In this paper, we show that the Diophantine equation Cn = Cm(q) has only finitely many integer solutions (m,n, q) with m > 1, n > 1, q > 1. Moreover, they are all effectively computable. – To Professor Carl Pomerance on his 65th birthday
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 40 شماره
صفحات -
تاریخ انتشار 1985