Javascript must be enabled to continue!
A Comparison of Integer Partitions Based on Smallest Part
View through CrossRef
For positive integers $n, L$ and $s$, consider the following two sets that both contain partitions of $n$ with the difference between the largest and smallest parts bounded by $L$: the first set contains partitions with smallest part $s$, while the second set contains partitions with smallest part at least $s+1$. Let $G_{L,s}(q)$ be the generating series whose coefficient of $q^n$ is difference between the sizes of the above two sets of partitions. This generating series was introduced by Berkovich and Uncu (2019). Previous results concentrated on the nonnegativity of $G_{L,s}(q)$ in the cases $s=1$ and $s=2$. In the present paper, we show the eventual positivity of $G_{L,s}(q)$ for general $s$ and also find a precise nonnegativity result for the case $s=3$.
The Electronic Journal of Combinatorics
Title: A Comparison of Integer Partitions Based on Smallest Part
Description:
For positive integers $n, L$ and $s$, consider the following two sets that both contain partitions of $n$ with the difference between the largest and smallest parts bounded by $L$: the first set contains partitions with smallest part $s$, while the second set contains partitions with smallest part at least $s+1$.
Let $G_{L,s}(q)$ be the generating series whose coefficient of $q^n$ is difference between the sizes of the above two sets of partitions.
This generating series was introduced by Berkovich and Uncu (2019).
Previous results concentrated on the nonnegativity of $G_{L,s}(q)$ in the cases $s=1$ and $s=2$.
In the present paper, we show the eventual positivity of $G_{L,s}(q)$ for general $s$ and also find a precise nonnegativity result for the case $s=3$.
.
Related Results
The number of smallest parts of Partitions of n
The number of smallest parts of Partitions of n
George E Andrews derived formula for the number of smallest parts of partitions of a positive integer n. In this paper we derived the generating function for the number of smallest...
Quelques résultats combinatoires autour de la décomposition de Littlewood
Quelques résultats combinatoires autour de la décomposition de Littlewood
Cette thèse s'intéresse à des objets de combinatoire énumérative et plus particulièrement aux partitions d'entiers. Les partitions et les tableaux de Young sont des objets combinat...
Partition Diversity in Complex Networks
Partition Diversity in Complex Networks
Diversité des partitions dans les réseaux complexes
La diversité des partitions dans les réseaux complexes provient de la coexistence de multiples manières plausibl...
Encoder Hurwitz Integers: The Hurwitz integers that have the ”division with small division” property
Encoder Hurwitz Integers: The Hurwitz integers that have the ”division with small division” property
Abstract
The residue class set of a Hurwitz integer is constructed by modulo function with primitive Hurwitz integer whose norm is a prime integer, i.e. prime Hurwitz integ...
Some New Results on the Number of Tagged Parts Over the Partitions with Designated Summands
Some New Results on the Number of Tagged Parts Over the Partitions with Designated Summands
The partitions with designated summands were introduced. In such partitions, among those parts of the same magnitude, one is tagged or designated. This work presents some new resul...
Congruences for hook lengths of partitions
Congruences for hook lengths of partitions
Recently, Amdeberhan
et al.
[Proc. Amer. Math. Soc. Ser. B 11 (2024), pp. 345–357] proved congruences for the number of hooks of fixed even ...
Hyperarbres et Partitions semi-pointées : aspects combinatoires, algébriques et homologiques
Hyperarbres et Partitions semi-pointées : aspects combinatoires, algébriques et homologiques
Cette thèse est consacrée à l’étude combinatoire, algébrique et homologique des hyperarbres et des partitions semi-pointées. Nous étudions plus précisément des structures algébriqu...
CRANK 0 PARTITIONS AND THE PARITY OF THE PARTITION FUNCTION
CRANK 0 PARTITIONS AND THE PARITY OF THE PARTITION FUNCTION
A well-known problem regarding the integer partition function p(n) is the parity problem, how often is p(n) even or odd? Motivated by this problem, we obtain the following results:...

