Partial Denominator Bounds for Partial Linear Difference Equations

2010/05/04 by Manuel Kauers, Carsten Schneider, Kauers, Manuel +1
Computer Science · #FOS: Computer and information sciences #Symbolic Computation (cs.SC) #cs.SC

paper · pdf · doi:10.48550/arxiv.1005.0602

arxiv created 2010/05/04 · arxiv updated 2010/05/05

Abstract

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and /aperiodic/. The main result is a generalization of a well-known denominator bounding technique for univariate equations to PLDEs. This generalization is able to find all the aperiodic factors of the denominators for a given PLDE.

Related

• A Refined Denominator Bounding Algorithm for Multivariate Linear Difference Equations
• Converging to Gosper's Algorithm
• Denominator Bounds for Systems of Recurrence Equations using ΠΣ-Extensions
• A Family of Denominator Bounds for First Order Linear Recurrence Systems
• Linear difference equations and periodic sequences over finite fields