Proves strict log-concavity of k-coloured partitions for k≥2 by showing p_k(b) > p_k(a) whenever b majorizes a, using recursive sequences and majorization.
Han,The Nekrasov-Okounkov hook length formula: refinement, elementary proof, extension and applicationsAnn
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Strict Log-concavity of $k$-coloured Partitions
Proves strict log-concavity of k-coloured partitions for k≥2 by showing p_k(b) > p_k(a) whenever b majorizes a, using recursive sequences and majorization.