Submultiplicative Polynomials in Combinatorics
arXiv:2607.11568
summary
The paper defines recursively constructed polynomials from normalized sequences and investigates when they satisfy a submultiplicative inequality similar to the Bessenrodt–Ono inequality for the partition function, providing an effective criterion for this property.
Abstract
For normalized sequences we consider recursively defined polynomials . In this paper we study their submultiplicative property, viewed as a Bessenrodt--Ono type inequality for the partition function, and provide an effective criterion for establishing it.
11 pages
Topics & keywords
#polynomials#submultiplicative property#partition function#recursive sequences#inequalitiessubmultiplicativeBessenrodt-Ono inequalitypartition functionrecursive polynomialsnormalized sequences