English

Efficiently determining Convergence in Polynomial Recurrence Sequences

Discrete Mathematics 2013-07-09 v1 Combinatorics

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.

Keywords

Cite

@article{arxiv.1307.2164,
  title  = {Efficiently determining Convergence in Polynomial Recurrence Sequences},
  author = {Deepak Ponvel Chermakani},
  journal= {arXiv preprint arXiv:1307.2164},
  year   = {2013}
}

Comments

11 pages, 4 Theorems, 1 Example for Polynomial Recurrence Sequence

R2 v1 2026-06-22T00:47:37.865Z