Talk:Constant-recursive sequence

This is an old revision of this page, as edited by Eric Rowland (talk | contribs) at 23:31, 7 November 2021 (Be more explicit about eventually-periodic case). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Latest comment: 3 years ago by Eric Rowland in topic Be more explicit about eventually-periodic case
WikiProject iconMathematics Start‑class Low‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
StartThis article has been rated as Start-class on Wikipedia's content assessment scale.
LowThis article has been rated as Low-priority on the project's priority scale.

Be more explicit about eventually-periodic case

Two possible improvements to this article:

  • Second, the article should clearly place itself relative to linear difference equation. These are basically the same concept. I think the latter article is excluding the eventually-periodic case, though. And maybe we should here too... best idea would be to dig up a reference textbook and see how they define it.

Thoughts? Happy to make some of these changes when I get the chance. Caleb Stanford (talk) 19:00, 7 November 2021 (UTC)Reply

Eventually periodic sequences can only be excluded artificially, since "  for all  " is equivalent to "  for all  ", which satisfies the definition of being constant-recursive. I agree it's worth discussing this in the article, as well as the fact that an "eventually constant-recursive" sequence is constant-recursive, for the same reason. The sequence   is described by an exponential polynomial, namely   since zero to the power of zero is   when the exponent only takes on integer values. Eric Rowland (talk) 23:31, 7 November 2021 (UTC)Reply