Partitions and the maximal excludant

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 σ\!maex(n) be the sum of maximal excludants over all partitions of n. We show that the generating function of σ\!maex(n) is closely related to a mock theta function studied by Andrews et al. and Cohen. Further, we show that, as n ∞, σ\!maex(n) is asymptotic to the sum of largest parts of all partitions of n. Finally, the expectation of the difference of the largest part and the maximal excludant over all partitions of n is shown to converge to 1 as n ∞.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…