skip to main content
10.1145/1837934.1837976acmotherconferencesArticle/Chapter ViewAbstractPublication PagesissacConference Proceedingsconference-collections
research-article

Partial denominator bounds for partial linear difference equations

Published:25 July 2010Publication History

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.

References

  1. Sergei A. Abramov. On the summation of rational functions. Zh. vychisl. mat. Fiz, pages 1071--1075, 1971.Google ScholarGoogle Scholar
  2. Sergei A. Abramov. Problems in computer algebra that are connected with a search for polynomial solutions of linear differential and difference equations. Moscow Univ. Comput. Math. Cybernet., 3:63--68, 1989.Google ScholarGoogle Scholar
  3. Sergei A. Abramov. Rational solutions of linear difference and q-difference equations with polynomial coefficients. In Proc. ISSAC'95, July 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Sergei A. Abramov and K. Yu. Kvashenko. Fast algorithms to search for the rational solutions of linear differential equations with polynomial coefficients. In Proc. ISSAC'91, pages 267--270, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Moulay Barkatou. Rational solutions of matrix difference equations: The problem of equivalence and factorization. In Proc. ISSAC'99, pages 277--282, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Alin Bostan, Frederic Chyzak, Thomas Cluzeau, and Bruno Salvy. Low complexity algorithms for linear recurrences. In Jean-Guillaume Dumas, editor, Proc. ISSAC'06, pages 31--39, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Manuel Bronstein. On solutions of linear ordinary difference equations in their coefficient field. Journal of Symbolic Computation, 29:841--877, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. William Y. C. Chen, Peter Paule, and Husam L. Saad. Converging to Gosper's algorithm. Adv. in Appl. Math., 41(3):351--364, 2008.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Amel Gheffar and Sergei Abramov. Valuations of rational solutions of linear difference equations at irreducible polynomials. (submitted).Google ScholarGoogle Scholar
  10. Serge Lang. Linear Algebra. Springer, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  11. Marko Petkovšek. Hypergeometric solutions of linear recurrences with polynomial coefficients. Journal of Symbolic Computation, 14(2--3):243--264, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Carsten Schneider. A collection of denominator bounds to solve parameterized linear difference equations in ΠΣ-extensions. In Proc. SYNASC'04, pages 269--282, 2004.Google ScholarGoogle Scholar
  13. Mark van Hoeij. Rational solutions of linear difference equations. In Proc. ISSAC'98, pages 120--123, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Christian Weixlbaumer. Solutions of difference equations with polynomial coefficients. Master's thesis, RISC-Linz, 2001.Google ScholarGoogle Scholar

Index Terms

  1. Partial denominator bounds for partial linear difference equations

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      ISSAC '10: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
      July 2010
      366 pages
      ISBN:9781450301503
      DOI:10.1145/1837934

      Copyright © 2010 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 25 July 2010

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      ISSAC '10 Paper Acceptance Rate45of110submissions,41%Overall Acceptance Rate395of838submissions,47%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader