Sequence characterizations of double Riordan arrays and their compressions

DOI10.1016/j.laa.2018.03.029zbMath1390.05011OpenAlexW2791091255WikidataQ130118877 ScholiaQ130118877MaRDI QIDQ1747115

Xianqiang Yang

Publication date: 3 May 2018

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2018.03.029

zbMATH Keywords

generating functionRiordan groupsuccession rule\(A\)-sequence\(Z\)-sequencedouble Riordan arrayshigh order Riordan arraysquasi-Riordan arrays

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Bell and Stirling numbers (11B73) Combinatorial identities, bijective combinatorics (05A19) Permutations, words, matrices (05A05) Special sequences and polynomials (11B83) Matrices of integers (15B36) Linear equations (linear algebraic aspects) (15A06) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (4)

On the halves of double and 3-dimensional Riordan arrays ⋮ \(q\)-double Riordan matrices ⋮ A \& Z sequences for double Riordan arrays ⋮ Endomorphisms of the Riordan group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The double Riordan group
• Matrix characterizations of Riordan arrays
• Production matrices and riordan arrays
• Sequence characterization of Riordan arrays
• The theory of the umbral calculus. I
• The Riordan group
• The umbral calculus
• The number of Baxter permutations
• Pascal triangles, Catalan numbers and renewal arrays
• Riordan arrays and combinatorial sums
• An algebraic characterization of the set of succession rules
• Production matrices
• Bijections and the Riordan group
• Trees associated with the Motzkin numbers
• Generating trees and forbidden subsequences
• Parametric Catalan numbers and Catalan triangles
• The Sheffer group and the Riordan group
• On the foundations of combinatorial theory. VIII: Finite operator calculus
• On Some Alternative Characterizations of Riordan Arrays
• ECO:a methodology for the enumeration of combinatorial objects
• Catalan Numbers
• Some open questions about random walks, involutions, limiting distributions, and generating functions

This page was built for publication: Sequence characterizations of double Riordan arrays and their compressions