44
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Efficiently determining Convergence in Polynomial Recurrence Sequences

      Preprint

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity. The basic idea of our approach is to construct a univariate polynomial equation in x, whose coefficients correspond to the terms of the Sequence. The approach then obtains the condition by analyzing five cases that cover all possible real values of x. The condition can be evaluated within time that is a polynomial function of the size of the description of the Polynomial Recurrence Sequence, hence convergence or non-convergence can be efficiently determined.

          Related collections

          Author and article information

          Journal
          1307.2164

          Combinatorics,Discrete mathematics & Graph theory
          Combinatorics, Discrete mathematics & Graph theory

          Comments

          Comment on this article