Some Inverse Relations Determined by Catalan Matrices

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Relations Between Generalized Fibonacci and Catalan Numbers

In a recent paper Aleksandar Cvetkovi c, Predrag Rajkovi c and Miloš Ivkovi c proved that for the Catalan numbers Cn the Hankel determinants of the sequence Cn þ Cnþ1 are Fibonacci numbers. Their proof depends on special properties of the corresponding orthogonal polynomials. In this paper we give a generalization of their result by other methods in order to give more insight into the situation...

متن کامل

Some recurrence relations for binary sequence matrices

This note compares and contrasts some properties of binary sequences with matrices and associated recurrence relations in order to stimulate some enrichment exercises and pattern puzzles.

متن کامل

Some Catalan Correspondences

One to one correspondences are established between planar rhyme schemes, planar partitions, connective relations and the associations of a product, which are all known to be enumerated by the Catalan numbers. The Catalan numbers c = [13; sequence 577] are well known as the number of ways of associating a product of n+1 terms [3, 4, 5,10,11,12]. Elementary ways of obtaining this result by consid...

متن کامل

Cramer's Rule for Generalized Inverse Solutions of Some Matrices Equations

By a generalized inverse of a given matrix, we mean a matrix that exists for a larger class of matrices than the nonsingular matrices, that has some of the properties of the usual inverse, and that agrees with inverse when given matrix happens to be nonsingular. In theory, there are many different generalized inverses that exist. We shall consider the Moore Penrose, weighted Moore-Penrose, Draz...

متن کامل

Some inverse eigenproblems for Jacobi and arrow matrices

Ve consider tl1e problem or re<:eH18l.r11dir1g Jacobi rnatric:e8 a.rid real symmetric: arrow ma.I.rices from two cigcnpairs. ,'\lgoritl1rn8 ror solving l.licsc i11vcr8c problem;; are presented. \Ve show that there are rea;;onable condition;;, under which this reconstruction is always possible. }foreover, it is ;;,een that in certain cases reconstruction can proceed with little or no cancellatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Combinatorics

سال: 2013

ISSN: 1687-9163,1687-9171

DOI: 10.1155/2013/528584