English

Partitions and the maximal excludant

Combinatorics 2019-05-16 v1

Abstract

For each nonempty integer partition π\pi, we define the maximal excludant of π\pi to be the largest nonnegative integer smaller than the largest part of π\pi that is not a part of π\pi. Let σ ⁣maex(n)\sigma\!\operatorname{maex}(n) be the sum of maximal excludants over all partitions of nn. We show that the generating function of σ ⁣maex(n)\sigma\!\operatorname{maex}(n) is closely related to a mock theta function studied by Andrews \textit{et al.} and Cohen. Further, we show that, as nn\to \infty, σ ⁣maex(n)\sigma\!\operatorname{maex}(n) is asymptotic to the sum of largest parts of all partitions of nn. Finally, the expectation of the difference of the largest part and the maximal excludant over all partitions of nn is shown to converge to 11 as nn\to \infty.

Keywords

Cite

@article{arxiv.1905.06304,
  title  = {Partitions and the maximal excludant},
  author = {Shane Chern},
  journal= {arXiv preprint arXiv:1905.06304},
  year   = {2019}
}
R2 v1 2026-06-23T09:07:42.542Z