English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper we investigate the generalization of the Bessenrodt--Ono inequality by following Gian-Carlo Rota's advice in studying problems in combinatorics and number theory in terms of roots of polynomials. We consider the number of $k$-colored partitions of $n$ as special values of polynomials $P_n(x)$. We prove for all real numbers $x >2 $ and $a,b \in \mathbb{N}$ with $a+b >2$ the inequality \begin{equation*} P_a(x) \, \cdot \, P_b(x) > P_{a+b}(x). \end{equation*} We show that $P_n(x) < P_{n+1}(x)$ for $x \geq 1$, which generalizes $p(n) < p(n+1)$, where $p(n)$ denotes the partition function. Finally, we observe for small values, the opposite can be true since for example: $P_2(-3+ \sqrt{10}) = P_{3}(-3 + \sqrt{10})$.

Polynomization of the Bessenrodt–Ono Inequality