Partitions and the maximal excludant
Combinatorics
2019-05-16 v1
Abstract
For each nonempty integer partition , we define the maximal excludant of to be the largest nonnegative integer smaller than the largest part of that is not a part of . Let be the sum of maximal excludants over all partitions of . We show that the generating function of is closely related to a mock theta function studied by Andrews \textit{et al.} and Cohen. Further, we show that, as , is asymptotic to the sum of largest parts of all partitions of . Finally, the expectation of the difference of the largest part and the maximal excludant over all partitions of is shown to converge to as .
Keywords
Cite
@article{arxiv.1905.06304,
title = {Partitions and the maximal excludant},
author = {Shane Chern},
journal= {arXiv preprint arXiv:1905.06304},
year = {2019}
}