Timeline for Recurrence relations with polynomial coefficients: an undecidable problem
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 13, 2015 at 11:02 | answer | added | Wadim Zudilin | timeline score: 2 | |
| S Nov 12, 2015 at 18:32 | history | suggested | Tadashi |
Added relevant tag
|
|
| Nov 12, 2015 at 18:24 | review | Suggested edits | |||
| S Nov 12, 2015 at 18:32 | |||||
| Nov 12, 2015 at 18:07 | comment | added | Per Alexandersson | Perhaps this is what you are looking for? arxiv.org/pdf/1203.0586v1.pdf The issue here is of course the nesting of a function, which in general makes a mess out of everything (for example, Julia sets etc. where several undecidable questions exists)... | |
| Nov 12, 2015 at 17:00 | comment | added | user40023 | It depends of what "solving" means. In Chapter 8 of the book "A = B", written by M. Petkovšek, H. S. Wilf, and D. Zeilberger, it is illustrate an algorithm to find if a recurrence with polynomial coefficient has a "closed form" in terms of hypergeometric functions or not. | |
| Nov 12, 2015 at 16:54 | history | asked | user119264 | CC BY-SA 3.0 |