Talk:Constant-recursive sequence: Difference between revisions

Content deleted Content added
Closer to discrete math than analysis
Line 1:
{{maths rating| class= Start| priority = Low| field= Discrete}}
 
== Be more explicit about eventually-periodic case ==
 
Two possible improvements to this article:
 
* First, I think we should update the article to be clearer about the case of sequences like <math>1, 0, 0, 0, \ldots</math>. This is allowed as a constant-recursive sequence according to the current text (see [[Constant-recursive sequence#Eventually periodic sequences|Eventually periodic sequences]]) but sections like [[Constant-recursive sequence#Characterization in terms of exponential polynomials|Characterization in terms of exponential polynomials]] do not apply for such sequences.
 
* 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. [[User:Caleb Stanford|Caleb Stanford]] ([[User talk:Caleb Stanford|talk]]) 19:00, 7 November 2021 (UTC)