Kutaisi International University

Submultiplicative polynomials in combinatorics

Abstract For normalized sequences $$\left( g(n)\right) _{n\in \mathbb {N}}$$ g ( n ) n ∈ N we consider recursively defined polynomials $$P_n^g(x)$$ P n g ( x ) . In this paper we study their submultiplicative property, viewed as a Bessenrodt–Ono type inequality for the partition...

SEQUENCES WITH INEQUALITIES

Abstract We consider infinite sequences of positive numbers. The connection between log-concavity and the Bessenrodt–Ono inequality has been the focus of several papers. It has applications in the white noise distribution theory and combinatorics. We improve a recent result by Be...