←back to thread

Analytic Combinatorics – A Worked Example

(grossack.site)
105 points mathgenius | 1 comments | 08 Apr 25 17:29 UTC | HN request time: 0.212s | source
Show context
1minusp ◴[08 Apr 25 18:45 UTC] No.43625194[source]▶
I find this interesting but the nomenclature escapes me: How is T(z) = z + zT + zT^2 + ... ? I find the jump from the functional programming description of the tree to this recurrence relation not intuitive
replies(3): >>43625235 #>>43625464 #>>43625949 #
1. paulpauper ◴[08 Apr 25 20:08 UTC] No.43625949[source]▶
He doesn't explain any of the notation, like how the brackets [z] work. Also the generating function he supplies is is wrong.