Control of cancellations that restrain the growth of a binomial recursion
From MaRDI portal
Publication:490769
DOI10.1007/S12220-014-9489-YzbMATH Open1327.05010arXiv1006.1340OpenAlexW2096003466MaRDI QIDQ490769FDOQ490769
Rodrigo A. Pérez, Magnus Aspenberg
Publication date: 28 August 2015
Published in: The Journal of Geometric Analysis (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1006.1340
Recommendations
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perturbation theory for linear operators.
- A survey of the theory of hypercube graphs
- Iteration of analytic functions
- Title not available (Why is that?)
- Combinatorial patterns for maps of the interval
Uses Software
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)