On a matrix representation for polynomially recursive sequences

zbMath1298.05039MaRDI QIDQ456374

Christophe Reutenauer

Publication date: 24 October 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v19i3p36

zbMATH Keywords

Galois theorymatrix representationP-recursive

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Basic hypergeometric functions in one variable, ({}_rphi_s) (33D15) Difference operators (39A70) Difference algebra (12H10)

Related Items (4)

Convolutions of Liouvillian sequences ⋮ The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients ⋮ Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects ⋮ Leapfrog constructions: from continuant polynomials to permanents of matrices

This page was built for publication: On a matrix representation for polynomially recursive sequences