Jordan canonical form of Pascal-type matrices via sequences of binomial type

DOI10.1016/j.dam.2008.01.010zbMath1182.05009OpenAlexW2092425978MaRDI QIDQ1005249

Sheng-Liang Yang

Publication date: 9 March 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.01.010

zbMATH Keywords

Jordan canonical formStirling numberiteration matrixBell polynomialgeneralized Pascal functional matrixPascal matrixsequence of binomial type

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19)

Related Items (1)

Every infinite triangular matrix is similar to a generalized infinite Jordan matrix

Cites Work

• Unnamed Item
• Matrices related to the Bell polynomials
• Generalized Pascal functional matrix and its applications
• The linear algebra of the generalized Pascal functional matrix
• The linear algebra of the Pascal matrix
• The algebraic properties of the generalized Pascal functional matrices associated with the exponential families
• Factorial Stirling matrix and related combinatorial sequences
• Pascal \(k\)-eliminated functional matrix and its property
• Some identities involving the binomial sequences
• The Matrices of Pascal and Other Greats
• Pascal's Matrices
• Stirling matrix via Pascal matrix
• The linear algebra of the generalized Pascal matrix

This page was built for publication: Jordan canonical form of Pascal-type matrices via sequences of binomial type