AN EFFICIENT ALGORITHM FOR DERIVING SUMMATION IDENTITIES FROM MUTUAL RECURRENCES

DOI10.1142/S1793830912500164zbMath1257.68149MaRDI QIDQ3166727

Edmund A. Lamagna, Berkeley R. Churchill

Publication date: 15 October 2012

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

zbMATH Keywords

computer algebrasummationmutual recurrence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Cites Work

• A fast algorithm for proving terminating hypergeometric identities
• Matrix multiplication via arithmetic progressions
• An extension of Zeilberger's fast algorithm to general holonomic functions
• A new Sigma approach to multi-summation
• Computing the algebraic relations of \(C\)-finite sequences and multisequences
• Closed form summation of 𝐶-finite sequences
• Summation in Finite Terms
• Decision procedure for indefinite hypergeometric summation

This page was built for publication: AN EFFICIENT ALGORITHM FOR DERIVING SUMMATION IDENTITIES FROM MUTUAL RECURRENCES