Content deleted Content added
add WP compsci |
Eric Rowland (talk | contribs) →Hasse diagram: new section |
||
Line 25:
Given that some definitions (see (ii) and the generating series definition) point to eventually-periodic sequences naturally being considered constant-recursive, I think I'm now somewhat inclined to allow <math>c_d = 0</math>. Also, it leads to a more general definition, in terms of many of the results (e.g. closure properties). For now, I edited the article with some clarifications to the definition. [[User:Caleb Stanford|Caleb Stanford]] ([[User talk:Caleb Stanford|talk]]) 01:57, 8 November 2021 (UTC)
== Hasse diagram ==
As currently defined, the set of order-<math>2</math> sequences doesn't include the set of order-<math>1</math> sequences, but the Hasse diagram implies that it does. The diagram can be fixed by writing "order <math>\leq 2</math>" and so on. Also, a vertical ellipsis might look nicer than a horizontal ellipsis for the omitted orders. [[User:Eric Rowland|Eric Rowland]] ([[User talk:Eric Rowland|talk]]) 17:33, 13 November 2021 (UTC)
| |||