Papers
Topics
Authors
Recent
Search
2000 character limit reached

On general approach to Bessenrodt-Ono type inequalities and log-concavity property

Published 22 Dec 2023 in math.NT and math.CO | (2312.14501v1)

Abstract: In recent literature concerning integer partitions one can find many results related to both the Bessenrodt-Ono type inequalities and log-concavity property. In this note we offer some general approach to this type of problems. More precisely, we prove that under some mild conditions on an increasing function $F$ of at most exponential growth satisfying the condition $F(\mathbb{N})\subset \mathbb{R}{+}$, we have $F(a)F(b)>F(a+b)$ for sufficiently large positive integers $a, b$. Moreover, we show that if the sequence $(F(n)){n\geq n_{0}}$ is log-concave and $\limsup_{n\rightarrow +\infty}F(n+n_{0})/F(n)<F(n_{0})$, then $F$ satisfies the Bessenrodt-Ono type inequality.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

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

Continue Learning

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

Collections

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