Generalized Pascal k-eliminated functional matrix with 2n variables

Generalized Pascal k-eliminated functional matrix with 2n variables

The Generalized Pascal Matrix via the Generalized Fibonacci Matrix and the Generalized Pell Matrix

In [4], the authors studied the Pascal matrix and the Stirling matrices of the first kind and the second kind via the Fibonacci matrix. In this paper, we consider generalizations of Pascal matrix, Fibonacci matrix and Pell matrix. And, by using Riordan method, we have factorizations of them. We, also, consider some combinatorial identities.

Extra Variables Can Be Eliminated from Functional Logic Programs

Programs in modern functional logic languages are rewrite systems following the constructor discipline but where confluence and termination are not required, thus defining possibly non strict and non-deterministic functions. While in practice and in some theoretical papers rewrite rules can contain extra variables in right hand sides, some other works and techniques do not consider such possibi...

An involutory Pascal matrix

An involutory upper triangular Pascal matrix Un is investigated. Eigenvectors of Un and of UT n are considered. A characterization of Un is obtained, and it is shown how the results can be extended to matrices over a commutative ring with unity. © 2004 Elsevier Inc. All rights reserved.

Frequency Transformation with Pascal Matrix Equations

Abstract—Frequency transformation with Pascal matrix equations is a method for transforming an electronic filter (analogue or digital) into another filter. The technique is based on frequency transformation in the s-domain, bilinear z-transform with pre-warping frequency, inverse bilinear transformation and a very useful application of the Pascal’s triangle that simplifies computing and enables...