Re:Analytic Combinatorics – A Worked Example
by sfpotter on Tuesday April 08, 2025 @03:01PM
(#43625353)
Author probably just unaware of Binet's formula. But I'd agree with their assessment that there's unlikely to be a closed form for the (indeed, much more complicated!) quantity that they're interested in.
[ Parent
| on HN ]
Re:Analytic Combinatorics – A Worked Example
by LegionMammal978 on Tuesday April 08, 2025 @03:38PM
(#43625678)
In fact, for that 'warmup' problem, the leading term has a base and coefficient that are roots of cubic polynomials, given in the OEIS entry. But often the coefficient will be trancendental for these sorts of problems.
Re:Analytic Combinatorics – A Worked Example
by aleph_minus_one on Wednesday April 09, 2025 @09:50AM
(#43632090)
> But often the coefficient will be tran[s]cendental for these sorts of problems.
What makes you believe that the coefficient will be transcendental? I'd rather expect some non-trivial algebraic number (i.e. root of some polynomial with rational coefficients).
Re:Analytic Combinatorics – A Worked Example
by PollardsRho on Tuesday April 08, 2025 @03:03PM
(#43625380)
They then say there's an approximation for Fibonacci, which makes me think that's what they're calling Binet's formula. (I'd also expect an author with this mathematical sophistication to be aware of Binet's formula, but maybe I'm projecting.)
Re:Analytic Combinatorics – A Worked Example
by paulpauper on Tuesday April 08, 2025 @05:44PM
(#43626760)
Yes, the Binet formula is a closed-form. It arises because of a 2nd order linear recursion , which is not the same as the generating function. Also he confuses the characteristic equation for the generating function. I would recommend a discreate math textbook if you want to learn this.