Timeline for How to find/guess a polynomial sequence?
Current License: CC BY-SA 2.5
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:58 | history | edited | CommunityBot |
replaced http://mathoverflow.net/ with https://mathoverflow.net/
|
|
| Jul 25, 2014 at 16:09 | history | edited | Andrés E. Caicedo |
edited tags
|
|
| Jul 23, 2010 at 9:38 | comment | added | Wadim Zudilin | Hmmm. It's my way to emancipate those who could potentially contribute to the question: I acknowledge any help in advance. You can see that Jacques wasn't brave with Bruce's question but posed his observations here. | |
| Jul 23, 2010 at 9:01 | comment | added | Victor Protsak | What does the tag "thanks" stand for? | |
| Jul 22, 2010 at 23:29 | comment | added | Wadim Zudilin | Will, his appearance reminded me on asking the question. :-) | |
| Jul 22, 2010 at 22:48 | comment | added | Will Jagy | Wadim, I am concerned that you mention the recent appearance of Bruce Westbury. Has he been dyeing his hair purple again? | |
| Jul 22, 2010 at 22:31 | answer | added | John D. Cook | timeline score: 0 | |
| Jul 22, 2010 at 17:04 | answer | added | Will Orrick | timeline score: 3 | |
| Jul 22, 2010 at 13:36 | comment | added | Wadim Zudilin | So, they are subjectively tractable... ;-) Any way, I like your optimistic intuition. | |
| Jul 22, 2010 at 13:17 | comment | added | Noldorin | @Wadim: I haven't really investigated it so I wouldn't now for sure. :) Intuition says it would possible, but may well scale expontentially with time - whether you call that tractable or not is up to you! | |
| Jul 22, 2010 at 13:07 | comment | added | Wadim Zudilin | In my profile I see that there was one more answer "There are sophisticated algorithms that do exactly that. There is a very powerful function in Mathematica: reference.wolfram.com/mathematica/ref/FindSequenceFunction.html" from user mathoverflow.net/users/1047/vonjd. I wonder why it's not here any more but indeed in the rubric "Generalizations & Extensions" there is an example of non-numerical guess. | |
| Jul 22, 2010 at 13:01 | comment | added | Wadim Zudilin | @Bruce: A good point. And I am still wondering on how the magic "FRICAS team" can be of help here... ;-) @Noldorin: I am trying to understand whether "not terribly tractable computationally" means tractable or not. | |
| Jul 22, 2010 at 12:28 | comment | added | Noldorin | Interesting question. Algorithmically, this strikes me as a problem that would belong to the PSPACE class or even higher, i.e. not terribly tractable computationally. | |
| Jul 22, 2010 at 12:15 | answer | added | Jacques Carette | timeline score: 7 | |
| Jul 22, 2010 at 11:45 | comment | added | Bruce Westbury | Maybe we should have on On-Line Encylopedia of Polynomial Sequences? | |
| Jul 22, 2010 at 11:13 | history | asked | Wadim Zudilin | CC BY-SA 2.5 |