Factorization of C-finite sequences

DOI10.1007/978-3-319-73232-9_6MaRDI QIDQ1716150zbMATH OpenOpenAlexFDO

Authors M. Kauers, Doron Zeilberger

Publication date 29 January 2019

Full work available at URL https://arxiv.org/abs/1601.02756

zbMATH Keywords

computer algebraclosure propertiesrecurrence equations

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Convergence and divergence of series and sequences (40A05) Iteration theory, iterative and composite equations (39B12)

Abstract: We discuss how to decide whether a given C-finite sequence can be written nontrivially as a product of two other C-finite sequences.

Cited in

(3)

• ALG.txt
• Chains of Factorizations and Factorizations with Successive Lengths
• Lonely points in simplices

This page was built for publication: Factorization of $C$-finite sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1716150)