Sign in
Back
Combinatorial Proof of a Partition Inequality of Bessenrodt-Ono
Journal article   Peer reviewed

Combinatorial Proof of a Partition Inequality of Bessenrodt-Ono

Abdulaziz A. Alanazi, Stephen M. Gagola and Augustine O. Munagi
Annals of combinatorics, Vol.21(3), pp.331-337
01/09/2017
DOI: https://doi.org/10.1007/s00026-017-0358-9

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
We provide a combinatorial proof of the inequality , where p(n) is the partition function and a, are integers satisfying . This problem was posed by Bessenrodt and Ono who used the inequality to study a new multiplicative property of an extended partition function [Ann. Combin. 20, 59-64 (2016)].

Metrics

1 Record Views

Details