A refinement of a result of Andrews and Newman on the sum of minimal excludants

dc.contributor.authorEyyunni, Pramod
dc.date.accessioned2025-02-10T09:20:48Z
dc.date.available2025-02-10T09:20:48Z
dc.date.issued2023-06
dc.description.abstractIn this article, we refine a result of Andrews and Newman, that is, the sum of minimal excludants over all the partitions of a number n equals the number of partitions of n into distinct parts with two colors. As a consequence, we find congruences modulo 4 and 8 for the functions appearing in this refinement. We also conjecture three further congruences for these functions. In addition, we also initiate the study of kth moments of minimal excludants. At the end, we also provide an alternate proof of a beautiful identity due to Hopkins, Sellers, and Stanton.en_US
dc.identifier.urihttps://link.springer.com/article/10.1007/s11139-023-00738-w
dc.identifier.urihttp://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17435
dc.language.isoenen_US
dc.publisherSpringeren_US
dc.subjectMathematicsen_US
dc.subjectPartitionsen_US
dc.subjectMinimal excludanten_US
dc.subjectColored partitionsen_US
dc.subjectRefinementen_US
dc.titleA refinement of a result of Andrews and Newman on the sum of minimal excludantsen_US
dc.typeArticleen_US

Files

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: