A general method for proving the non-trivial linear homogeneous partition inequalities
From MaRDI portal
Publication:2303442
DOI10.1007/S11139-018-0125-5zbMath1434.05014OpenAlexW2945757515MaRDI QIDQ2303442
Publication date: 3 March 2020
Published in: The Ramanujan Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11139-018-0125-5
Combinatorial aspects of partitions of integers (05A17) Combinatorial inequalities (05A20) Elementary theory of partitions (11P81)
Related Items (11)
A further look at cubic partitions ⋮ Linear inequalities concerning the sum of the distinct parts congruent to r modulo m in all the partitions of n ⋮ A unified framework to prove multiplicative inequalities for the partition function ⋮ 4-regular partitions and the pod function ⋮ 6-regular partitions: new combinatorial properties, congruences, and linear inequalities ⋮ On the partitions into distinct parts and odd parts ⋮ Polygonal numbers and Rogers-Ramanujan-Gordon theorem ⋮ On the number of partitions into parts not congruent to \(0, \pm 3\pmod{12}\) ⋮ Unnamed Item ⋮ A reversal of Schur's partition theorem ⋮ THE SECOND SHIFTED DIFFERENCE OF PARTITIONS AND ITS APPLICATIONS
Cites Work
- Unnamed Item
- Unnamed Item
- Maximal multiplicative properties of partitions
- The truncated pentagonal number theorem
- Log-concavity of the partition function
- The Prouhet-Tarry-Escott problem revisited
- Asymptotically trivial linear homogeneous partition inequalities
- Truncated theta series and a problem of Guo and Zeng
- Fast algorithm for generating ascending compositions
- Differences of the partition function
- Asymptotic behavior of high‐order differences of the partition function
- Finite Differences of the Partition Function
- Partition Asymptotics from Recursion Equations
- A Convergent Series for the Partition Function p ( n )
This page was built for publication: A general method for proving the non-trivial linear homogeneous partition inequalities
