Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 186 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 32 tok/s Pro
GPT-4o 65 tok/s Pro
Kimi K2 229 tok/s Pro
GPT OSS 120B 441 tok/s Pro
Claude Sonnet 4.5 38 tok/s Pro
2000 character limit reached

Log-concavity of $P$-recursive sequences (2008.05604v3)

Published 30 Jul 2020 in math.CO and math.CA

Abstract: We consider the higher order Tur\'an inequality and higher order log-concavity for sequences ${a_n}{n \ge 0}$ such that [ \frac{a{n-1}a_{n+1}}{a_n2} = 1 + \sum_{i=1}m \frac{r_i(\log n)}{n{\alpha_i}} + o\left( \frac{1}{n{\beta}} \right), ] where $m$ is a nonnegative integer, $\alpha_i$ are real numbers, $r_i(x)$ are rational functions of $x$ and [ 0 < \alpha_1 < \alpha_2 < \cdots < \alpha_m < \beta. ] We will give a sufficient condition on the higher order Tur\'an inequality and the $r$-log-concavity for $n$ sufficiently large. Most $P$-recursive sequences fall in this frame. At last, we will give a method to find the exact $N$ such that for any $n>N$, the higher order Tur\'an inequality holds.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.