Control of cancellations that restrain the growth of a binomial recursion
From MaRDI portal
(Redirected from Publication:490769)
Abstract: We study a recursion that generates real sequences depending on a parameter . Given a negative the growth of the sequence is very difficult to estimate due to canceling terms. We reduce the study of the recursion to a problem about a family of integral operators, and prove that for every parameter value except -1, the growth of the sequence is factorial. In the combinatorial part of the proof we show that when the resulting recurrence yields the sequence of alternating Catalan numbers, and thus has exponential growth. We expect our methods to be useful in a variety of similar situations.
Recommendations
Cites work
- scientific article; zbMATH DE number 47995 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- A brief but historic article of Siegel
- A survey of the theory of hypercube graphs
- Combinatorial patterns for maps of the interval
- Iteration of analytic functions
- Perturbation theory for linear operators.
- The On-Line Encyclopedia of Integer Sequences
This page was built for publication: Control of cancellations that restrain the growth of a binomial recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490769)