Please use this identifier to cite or link to this item:
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17435Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Eyyunni, Pramod | - |
| dc.date.accessioned | 2025-02-10T09:20:48Z | - |
| dc.date.available | 2025-02-10T09:20:48Z | - |
| dc.date.issued | 2023-06 | - |
| dc.identifier.uri | https://link.springer.com/article/10.1007/s11139-023-00738-w | - |
| dc.identifier.uri | http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17435 | - |
| dc.description.abstract | In 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.language.iso | en | en_US |
| dc.publisher | Springer | en_US |
| dc.subject | Mathematics | en_US |
| dc.subject | Partitions | en_US |
| dc.subject | Minimal excludant | en_US |
| dc.subject | Colored partitions | en_US |
| dc.subject | Refinement | en_US |
| dc.title | A refinement of a result of Andrews and Newman on the sum of minimal excludants | en_US |
| dc.type | Article | en_US |
| Appears in Collections: | Department of Mathematics | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.