نتایج جستجو برای: pascal matrix

تعداد نتایج: 368678  

2010
A. R. MOGHADDAMFAR

Let L(n)p be the Pascal lower triangular matrix with coefficients `i j ́ (mod p), 0 ≤ i, j < n. In this paper, we found the inverse of L(n)p modulo p. In fact, we generalize a result due to David Callan [4].

2010
Pascal O. Vontobel

It has recently been observed that the permanent of a non-negative matrix, i.e., of a matrix containing only nonnegative real entries, can very well be approximated by solving a certain Bethe free energy minimization problem with the help of the sum-product algorithm. We call the resulting approximation of the permanent the Bethe permanent. In this paper we give reasons why this approach to app...

2000
Pantelimon Stanica

It is known that if Ln, respectively Rn9 are n x n matrices with the (/, j ) * entry the binomial coefficient (y~l)? respectively (^l)), then Ln = In (mod 2), respectively R„=In (mod 2), where In is the identity matrix of dimension n>\ (see, e.g., Problem PI 073 5 in the May 1999 issue of Arner. Math Monthly). The entries of Ln form a left-justified Pascal triangle and the entries of Rn result ...

Journal: :Kragujevac journal of mathematics 2021

In this paper, we introduce a new extension of the generalized Apostol-Frobenius-Euler polynomials ℋn[m−1,α](x; c,a; λ; u). We give some algebraic and differential properties, as well as, relationships between class with other numbers. also, matrix ????[m−1,α](x; u) ????[m−1,α](c,a; u), deduce product formula for provide factorizations polynomial which involving Pascal matrix.

2007
Babiga Birregah Prosper K. Doh

In this work we present some matrix operators named circulant operators and their action on square matrices. This study on square matrices provides new insights into the structure of the space of square matrices. Moreover it can be useful in various fields as in agents networking on Grid or large-scale distributed self-organizing grid systems. Keywords— Pascal matrices, Binomial Recursion, Circ...

Journal: :Eur. J. Comb. 2010
Emrah Kilic

The Fibonomial coe¢ cients are known as interesting generalization of binomial coe¢ cients. In this paper, we derive a (k + 1)th recurrence relation and generating matrix for the Fibonomial coe¢ cients, which we call generalized Fibonomial matrix. We …nd a nice relationship between the eigenvalues of the Fibonomial matrix and the generalized right-adjusted Pascal matrix that they have the same ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید