1
$\begingroup$

Are there any necessary and sufficient conditions on types of generating functions which guarantee the existence/nonexistence of a closed form for the sequence they enumerate?

Generating functions based on linear recurrence relations clearly always do (by annihilators), but are there more general statements to be made about other types of OGFs? What about DGFs and others? Does limiting the generating functions we consider to be ones obtained from different varieties of recurrence relations allow more concrete answers to be produced?

Also, if there are books, journals, or specific papers on the topic, please link them! This is fascinating stuff.

$\endgroup$
  • $\begingroup$ Google and download the free book $A=B$. $\endgroup$ – user141763 Apr 17 '14 at 23:41
  • $\begingroup$ Ditto for generatingfunctionology, also look for "Analytic Combinatorics". Those should keep you busy for a while $\endgroup$ – vonbrand Apr 17 '14 at 23:58
  • $\begingroup$ The first step would be to precisely define "closed form". $\endgroup$ – Nate Eldredge Apr 18 '14 at 1:36
1
$\begingroup$

Here's a link where you can find the books generatingfunctionology and $A=B$ mentioned in the comments.

| cite | improve this answer | |
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.