Thank you! That has quite a bit of information that's new to me. On Tue, Sep 7, 2010 at 1:03 AM, Joerg Arndt <arndt@jjj.de> wrote:
I have only one relevant entry in my bib.tex:
Philippe Flajolet: {Combinatorial aspects of continued fractions}, Discrete Mathematics, vol.32, no.2, pp.125-161, (1980). URL: \url{http://algo.inria.fr/flajolet/Publications/publist.html}.
I can send the pdf as personal email to anyone without subscription, just ask.
* Mike Stay <metaweta@gmail.com> [Sep 06. 2010 15:52]:
Generating functions have a pretty clear combinatorial interpretation: the coefficient on x^n is the number of ways to put a particular structure on an n-element totally ordered set. Is there any clear combinatorial interpretation of the terms of a simple continued fraction? -- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com