An identity of Andrews and a new method for the Riordan array proof of combinatorial identities
نویسنده
چکیده
We consider an identity relating Fibonacci numbers to Pascal’s triangle discovered by G. E. Andrews. Several authors provided proofs of this identity, most of them rather involved or else relying on sophisticated number theoretical arguments. We present a new proof, quite simple and based on a Riordan array argument. The main point of the proof is the construction of a new Riordan array from a given Riordan array, by the elimination of elements. We extend the method and as an application we obtain other identities, some of which are new. An important feature of our construction is that it establishes a nice connection between the generating function of the A−sequence of a certain class of Riordan arrays and hypergeometric functions.
منابع مشابه
Playing with Some Identities of Andrews
We study two remarkable identities of Andrews relating Fibonacci numbers and binomial coefficients in terms of generating functions and Riordan arrays. We thus give a deeper insight to the problem and find several new identities involving many other well-known sequences.
متن کاملAn algorithm for proving identities with Riordan transformations
The problem we consider in the present paper is how to find the closed form of a class of combinatorial sums, if it exists. The problem is well known in the literature, and is as old as Combinatorial Analysis is, since we can go back at least to Euler’s time. More recently, Riordan has tried to give a general approach to the subject, proposing a variety of methods, many of which are related to ...
متن کاملOn Series Expansions of Capparelli’s Infinite Product
Using Lie theory, Stefano Capparelli conjectured an interesting Rogers-Ramanujan type partition identity in his 1988 Rutgers Ph.D. thesis. The first proof was given by George Andrews, using combinatorial methods. Later, Capparelli was able to provide a Lie theoretic proof. Most combinatorial Rogers-Ramanujan type identities (e.g. the Göllnitz-Gordon identities, Gordon’s combinatorial generaliza...
متن کاملCombinatorial telescoping for an identity of Andrews on parity in partitions
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the combinatorial objects corresponding to a sum of positive terms, we establish bijections that lead a telescoping relation. We illustrate this idea by giving a combinat...
متن کاملA class of formal Operators for Combinatorial identities and its Application
In this paper, we present some formulas of symbolic operator summation, which involving Generalization well-know number sequences or polynomial sequences, and mean while we obtain some identities about the sequences by employing M-R‘s substitution rule. Keywords—Generating functions; Operators sequence group; Riordan arrays; R.G Operator group; Combinatorial identities.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008