The Minimal excludant of-regular partition

arXiv:2611.06072 · math.NT · Submitted 2026-11-04 · Read on arXiv

math.NT

Submitted: 2026-11-04

Updated: 2026-11-04

Comments: First draft of the paper

License: http://creativecommons.org/licenses/by/4.0/

The gist: Andrews and Newman introduced and studied ``mex,'' function for an integer partition λ of a positive integer n.

Abstract

Andrews and Newman introduced and studied ``mex,'' function for an integer partition λ of a positive integer n. The related function σ mex(n) was subsequently defined, and its generating function and other properties have been studied by several authors. In this article, for a positive integer at least 2, we define the minimal excludant of an-regular partition λ of a positive integer n. We then define σ mex(n), the sum of the minimal excludants over all-regular partitions of n, and obtain explicit generating functions for σ mex(n) in the cases = 2 and = 3, expressed as eta-quotients. We prove that the sequence σ mex(n) is weakly increasing for every, and we obtain Hardy--Ramanujan type asymptotic formulas for σ 2 mex(n) and σ 3 mex(n) as n to infinity. Additionally, we completely determine the parity of σ 2 mex(n), showing that it is odd precisely at generalized pentagonal numbers, and we use this characterization to compute the density of n for which σ 2 mex(n) is odd versus even. Finally, for σ 3 mex(n), we prove that it is odd infinitely often, and we establish a quantitative lower bound, showing that the number of such n up to X grows at least like X.

Related papers