The Ramanujan Journal· 2026Q2
Submultiplicative polynomials in combinatorics
- 0citations
- Q2SCImago
- 2026year
Short summary
Researchers introduce a criterion to prove the submultiplicative property of recursively defined polynomials, extending Bessenrodt-Ono type inequalities to the partition function.
AI-generated from the title and abstract; the full text is not read.
Key points
- Focuses on normalized, recursively defined polynomials (P_n^g(x)).
- Studies the submultiplicative property of these polynomials.
- Provides an effective criterion for establishing submultiplicativity.
- Connects this property to Bessenrodt-Ono type inequalities for the partition function.
AI-generated from the title and abstract; the full text is not read.
Abstract
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 function, and provide an effective criterion for establishing it.
The authors' abstract, as published at the source. The Ramanujan Journal, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Discrete Mathematics and Combinatorics
Discrete Mathematics and CombinatoricsMathematics