| dc.contributor.author |
Eyyunni, Pramod |
|
| dc.date.accessioned |
2025-02-10T09:15:38Z |
|
| dc.date.available |
2025-02-10T09:15:38Z |
|
| dc.date.issued |
2024-08 |
|
| dc.identifier.uri |
https://projecteuclid.org/journals/rocky-mountain-journal-of-mathematics/volume-54/issue-4/THE-SECOND-MINIMAL-EXCLUDANT-AND-MEX-SEQUENCES/10.1216/rmj.2024.54.1117.short |
|
| dc.identifier.uri |
http://dspace.bits-pilani.ac.in:8080/jspui/handle/123456789/17434 |
|
| dc.description.abstract |
The minimal excludant of an integer partition, first studied prominently by Andrews and Newman from a combinatorial viewpoint, is the smallest positive integer missing from a partition. Several generalizations of this concept are being explored by mathematicians nowadays. We analogously consider the second minimal excludant of a partition and analyze its relationship with the minimal excludant. This leads us to the notion of a mex sequence and we derive two neat identities involving the number of partitions whose mex sequence has length at least r |
en_US |
| dc.language.iso |
en |
en_US |
| dc.publisher |
Rocky Mountain Mathematics Consortium |
en_US |
| dc.subject |
Mathematics |
en_US |
| dc.subject |
Mex sequences |
en_US |
| dc.subject |
Minimal excludant |
en_US |
| dc.subject |
Partition identities |
en_US |
| dc.title |
The second minimal excludant and mex sequences |
en_US |
| dc.type |
Article |
en_US |