$\ell$-Log-momotonic and Laguerre Inequality of P-recursive Sequences
Guo-Jie Li

TL;DR
This paper studies $ ext{ell}$-log-momotonic and Laguerre inequalities for P-recursive sequences with specific asymptotic behaviors, providing conditions and methods to verify these inequalities for large indices.
Contribution
It introduces new sufficient conditions for $ ext{ell}$-log-momotonicity and Laguerre inequalities in P-recursive sequences, along with a method to determine the threshold index for these properties.
Findings
Provides a framework for analyzing asymptotic ratios of P-recursive sequences.
Establishes sufficient conditions for log-momotonicity and Laguerre inequalities.
Offers a method to find the index beyond which inequalities hold.
Abstract
We consider -log-momotonic sequences and Laguerre inequality of order two for sequences such that \[ \frac{a_{n-1}a_{n+1}}{a_n^2} = 1 + \sum_{i=1}^m \frac{r_i(\log n)}{n^{\alpha_i}} + o\left( \frac{1}{n^{\beta}} \right), \] where is a nonnegative integer, are real numbers, are rational functions of and \[ 0 < \alpha_1 < \alpha_2 < \cdots < \alpha_m < \beta. \] We will give a sufficient condition on -log-momotonic sequences and Laguerre inequality of order two for sufficiently large. Many P-recursive sequences fall in this frame. At last, we will give a method to find the such that for any , log-momotonic inequality of order three and Laguerre inequality of order two holds.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Coding theory and cryptography
