Andrews and Newman \cite{andrewsnewmanI} 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 ℓ≥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 σ2mex(n) and σ3mex(n) as n→∞. Additionally, we completely determine the parity of σ2mex(n), showing that it is odd precisely at generalized pentagonal numbers, and we use this characterization to compute the density of n for which σ2mex(n) is odd versus even. Finally, for σ3mex(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 loglogX.
Introduction and Statement of Results
A partition π=(π1,π2,…,πk) of a non-negative integer n is a non-increasing sequence of positive integers summing to n. Let p(n) denote the number of partitions of n, and let P(n) denote the set of all partitions of n. Grabner and Knopfmacher [10] introduced and studied an interesting partition statistic which they called the smallest gap of a partition, namely the least positive integer missing from its parts.
In 2019, Andrews and Newman [3, 4] revisited this idea, thereby rediscovering the Grabner–Knopfmacher statistic, and went on to generalize it very naturally to arithmetic progressions. They defined
σmex(n):=π∈P(n)∑mex(π),
and proved the striking identity
σmex(n)=D2(n).(1)
where D2(n) denotes the number of two-colored partitions of n into distinct parts; the corresponding generating function had, in fact, already appeared implicitly in the work of Grabner and Knopfmacher. They also obtained a Hardy–Ramanujan–Rademacher type exact formula for σmex(n) in terms of Bessel functions and Dedekind sums, together with the asymptotic estimate σmex(n)∼46n3/41exp(π32n) as n→∞. In the same paper, they introduced a second
Keywords: ℓ-regular partition; Minimal excludant, Asymptotic formula, parity result arithmetic function
a(n):=π∈P(n)mex(π)odd∑1,
and showed that σmex(n)≡a(n)(mod2), with a(n) is almost always even and is odd exactly when n is of the form r(3r±1), for some positive integer r. In 2021, Ballantine and Merca [5] gave a combinatorial proof of the Andrews–Newman identity (1.1). Barman and Singh [6, 7], and later da Silva and Sellers [16], established further congruences and parity results for mex-related partition functions. In 2021, Chern [9] introduced the notion of the maximal excludantmaex(π), the largest integer below the biggest part of π that fails to occur in π, and obtained both a generating function identity for σmaex(n):=∑π∈P(n)maex(π) and the asymptotic relation σmaex(n)∼σL(n), where σL(n) is the sum of the largest parts over all partitions of n, with σL(n) itself satisfying a Hardy–Ramanujan type formula due to Kessler and Livingston [14]. In 2022, Kaur, Bhoria, Eyyunni and Maji [13] have extended these investigations to mex statistics on partitions restricted in various ways, such as partitions into distinct parts and they studied the sum of minimal excludants over partitions into distinct parts σdmex(n) and found a connection of Ramanujan’s sum σ(q) with the sum function σdmex(n). In 2026, Baruah and Talukdar [8] studied the partition functions involving least r gaps and obtained the generating function of the related sum function in terms of eta quotients, studied their asymptotic formula. This growing literature makes clear that the minimal excludant, though a simple combinatorial rule, interacts richly with q-series, modular forms, and analytic number theory. Motivated by the above results, we study the minimal excludant of ℓ-regular partitions.
Let ℓ≥2 be a positive integer. Let Pℓ(n) denote the set of all ℓ-regular partitions of n and pℓ(n):=∣Pℓ(n)∣. For a partition λ∈Pℓ(n), the ℓ-regular minimal excludant is defined by mexℓ(λ):=min{r≥1:ℓ∤r,r∈/λ}. In other words, mexℓ(λ) is the smallest positive integer that is not divisible by ℓ and does not occur as a part of λ. Let m be positive integer such that ℓ∤m. We define
pℓmex(m,n):=#{λ∈Pℓ(n):mexℓ(λ)=m}.
If ℓ∣m, then pℓmex(m,n)=0, by convention. We consider some examples to understand the above definitions.
Example 1. Let ℓ=3 and n=12. Then, the admissible parts are 1,2,4,5,7,8,10,11,….
Consider λ=(8,2,2). The missing admissible parts are 1,4,5,7,…. Hence mex3(λ)=1.
Let λ=(7,2,2,1). The missing admissible parts are 4,5,8,…. Therefore mex3(λ)=4.
Let λ=(5,4,2,1). The missing admissible integers are 7,8,10,…. Hence mex3(λ)=7.
Notice that mexℓ is unbounded.
Writing Pℓ(n) for the set of ℓ-regular partitions of n, we let pℓmex(m,n) denote the number of λ∈Pℓ(n) with mexℓ(λ)=m, ℓ∤m. In this article, we derive a general two-variable generating function for this statistic in Proposition 1. Our main object of study is the aggregate function
σℓmex(n):=λ∈Pℓ(n)∑mexℓ(λ),
the natural analogue of σmex(n) for ℓ-regular partitions. We obtain explicit generating functions for σℓmex(n) expressed as eta-quotients for ℓ=2 and ℓ=3.
Let λ∈P2(n). Suppose that mex2(λ)=2r−1. Then 1,3,5,…,2r−3 all occur as parts of λ, whereas 2r−1 does not occur. We define p2mex(r,n):=#{λ∈P2(n):mex2(λ)=2r−1}.
Further, we show that {σℓmex(n)}n≥0 is weakly increasing for every ℓ≥2. In particular, we find the following result.
Theorem 1.3. The sequence {σℓmex(n)}n≥0 is weakly increasing. Moreover, it satisfies the following inequality
σℓmex(n+1)−σℓmex(n)≥pℓ(n)−pℓ(n−1).(4)
Using Tauberian theorem of Ingham, we establish Hardy–Ramanujan type asymptotic formulas for σ2mex(n) and σ3mex(n). In particular, we have the following results.
Theorem 1.4. We have
σ2mex(n)∼22n1eπn/3,asn→∞.
Theorem 1.5. We have
σ3mex(n)∼4n1e32πn,asn→∞.
We further determine the parity of σ2mex(n) completely, showing that it is odd precisely at generalized pentagonal numbers, exactly as in the Andrews–Newman setting, and deduce the corresponding density of n for which σ2mex(n) is odd versus even. In particular, we get the following results.
Theorem 1.6. For every real number X≥1, we have
#{1≤n≤X:σ2mex(n) is an odd integer}=326X+O(1),
while
#{1≤n≤X:σ2mex(n) is an even integer}=X−326X+O(1).
Finally, we prove that σ3mex(n) is odd infinitely often, with a quantitative lower bound of order loglogX for the number of such n up to X. In particular, we obtain the following result.
Lemma 2.3 ([12]). Let B(q):=∑n=0∞b(n)qn be a power series with radius of convergence 1. Assume that {b(n)} is a weakly increasing sequence of non-negative real numbers. If there are constants β,γ∈R and μ>0 such that
B(e−y)∼βyγeμ/y,as y→0+,
then we have
b(n)∼2πβn42γ+3μ42γ+1e2μnas n→∞.
Lemma 2.4. For any positive integer u and j, and a prime number p, we obtain
(qu;qu)∞pj≡(qpu;qpu)∞pj−1(modpj).(6)
Lemma 2.5. Euler’s pentagonal theorem gives the expansion
Since mex2(λ)=2r−1, the compulsory odd parts are 1,3,5,…,2r−3 and their sum is
1+3+⋯+(2r−3)=(r−1)2.
Hence, these compulsory parts contribute q(r−1)2∏j=1r−21−q2j+11. The part 2r−1 is excluded, while every larger odd part may occur with arbitrary multiplicity. Thus,
Proof of Theorem 1.3. Consider the map ϕ:Pℓ(n)⟶Pℓ(n+1) by ϕ(λ)=λ∪{1}. Since 1 is never divisible by ℓ, ϕ(λ) is still an ℓ-regular partition. Moreover, ∣ϕ(λ)∣=∣λ∣+1=n+1. The map is injective, because if ϕ(λ1)=ϕ(λ2), then removing one copy of 1 from both partitions gives λ1=λ2. Now, we consider two cases. Firstly, suppose that 1∈λ, then mexℓ(λ)>1. Adding another 1 does not change whether any other part occurs. Hence mexℓ(ϕ(λ))=mexℓ(λ). Secondly, suppose that 1∈/λ, then mexℓ(λ)=1. After adding 1, 1∈ϕ(λ). Therefore, the mex of ϕ(λ) is the smallest positive integer other than 1 which is not divisible by ℓ and does not occur in λ. Thus, mexℓ(ϕ(λ))>1=mexℓ(λ). Therefore, in both cases, mexℓ(ϕ(λ))≥mexℓ(λ). Since ϕ is injective, we have
Hence σℓmex(n+1)≥σℓmex(n) (n≥0). Therefore, the sequence {σℓmex(n)}n≥0 is weakly increasing for every ℓ≥2.
As defined earlier, we have pℓ(n)=∣Pℓ(n)∣. Every partition λ∈Pℓ(n) with 1∈/λ satisfies mexℓ(λ)=1. After adding a part 1, its mex becomes strictly larger, i.e. mexℓ(ϕ(λ))>1=mexℓ(λ). If 1∈λ, then mexℓ(ϕ(λ))=mexℓ(λ). Hence
σℓmex(n+1)−σℓmex(n)≥#{λ∈Pℓ(n):1∈/λ}.(32)
Now consider the partitions in Pℓ(n) which contain at least one part 1. Removing one occurrence of 1 gives a bijection with Pℓ(n−1). Therefore,
Lemma 3.2. For every integer r≥2 satisfying r≡2(mod3), there exists an integer n∈[2r−1,2r(3r−1)] such that σ3mex(n)≡1(mod2). In particular, there are infinitely many integers n for which σ3mex(n) is an odd integer. ::
Proof. On contrary suppose that σ3mex(n) is even for every 2r−1≤n≤2r(3r−1). We define
since σ3mex(S(r))=σ3mex(0)=1. Now we show that S(s),R(s) lie in the interval [2r−1,2r(3r−1)] for 1≤s≤r−1. Notice that S(0)=2r(3r−1), S(r−1)=3r−2. Note that S(s) decreases in s and the smallest value for 0≤s≤r−1 is S(r−1). Since 3r−2≥2r−1(r≥1), we have 2r−1≤S(s)≤2r(3r−1), for 0≤s≤r−1. Similarly, for 1≤s≤r−1, again R(s) decreases with s, and R(r−1)=2r−1. Thus 2r−1≤R(s)≤2r(3r−1). Therefore, S(s),R(s) lie in the interval [2r−1,2r(3r−1)]. By our assumption, the left-hand side of (3.40) is 1+0+0≡1(mod2), contradicting (3.40), which says that it is 0(mod2). Therefore, at least one integer n from n∈[2r−1,2r(3r−1)] such that σ3mex(n)≡1(mod2).
Proof of Theorem 1.7
Proof of Theorem 1.7. Suppose ak≡2(mod3), for some positive integer k. Then ak+1=2ak(3ak−1)≡2(mod3). Thus, ak≡2(mod3) for every k≥0. In particular, we choose a0=2, a1=5, a2=35, and so on. By applying the Lemma 3.2 with r=ak, there exists some integer nk such that
Let ν be the largest integer such that aν≤X. Then aν≤X<aν+1. From (3.41), we have nk≥2ak−1. Since ak+1=2ak(3ak−1), we have, for ak≥2, ak+1>2ak. Thus the interval [2ak−1,ak+1] is disjoint with the analogous interval corresponding to k+2. Now the number of nk for which σ3mex(nk) is odd is at least ν. Now for all k≥0, we obtain
ak+1=2ak(3ak−1)<23ak2<2ak2.
On iteration, we get ak<(2a0)2k<52k⟹loglogak<klog2+loglog5. Since aν≤X<aν+1, we have loglogX<loglogaν+1<νlog2+C where C=loglog5+log2 is a fixed constant. Therefore, for sufficiently large X,ν≫loglogX.
Conclusion
In this paper, we have introduced and studied the minimal excludant statistic for ℓ-regular partitions, extending the classical work of Andrews and Newman to this more general setting. Further, we obtained explicit eta-quotient representations for its generating function when ℓ=2 and ℓ=3, revealing an elegant connection between this combinatorial statistic and the theory of modular forms. We also obtained asymptotic formula for σ2max(n) and σ3max(n). Further we obtained that the parity result for σ2max(n) is governed entirely by the generalized pentagonal numbers which helps us to find a density result for σ2max(n) while σ3max(n) is shown to be odd infinitely often, with a quantitative loglogX lower bound obtained through a delicate dissection argument involving Euler’s pentagonal number theorem modulo 2. These results suggest that the minimal excludant statistic for ℓ-regular partitions carries rich arithmetic structure worthy of further exploration. Natural directions for future work include extending the parity and density results to σℓmax(n) for ℓ≥4, investigating congruences modulo primes other than 2, and studying the mex statistic for other classes of restricted partitions.
Data availability statement: There is no data associated to our manuscript.
References
Nabin Kumar Meher, Department of Mathematics, National Institute of Technology Raipur, G. E. Road, Raipur, Chhattisgarh, India 492010.
[2]G. E. Andrews, The Theory of Partition, Reprint of the 1976 original. Cambridge University Press, Cambridge (2010).
[3]G. E. Andrews, D. Newman, Partitions and the minimal excludant, Ann. Comb. 23 (2019), no. 2, 249–254.DOI
[4]G. E. Andrews, D. Newman, The minimal excludant in integer partitions, J. Integer Seq. 23 (2020), Article 20.2.3.
[5]C. Ballantine, M. Merca, Combinatorial proof of the minimal excludant theorem, Int. J. Number Theory, 17, No. 8, 1765–1779 (2021).arxiv.org/abs/1908.06789
[6]R. Barman, A. Singh, On Mex-related partition functions of Andrews and Newman, Res. Number Theory, 7, 53 (2021).arxiv.org/abs/2009.11602
[7]R. Barman, A. Singh, Mex-related partition functions of Andrews and Newman, J. Integer Seq., 24 (2021), Article 21.6.3.arxiv.org/abs/2009.11602
[8]N. D. Baruah, P. Talukdar, Arithmetic and asymptotic properties for some functions related to the least r-gaps of partitions, Ann. Comb., 30 (2026), 526–551.DOI
[9]S. Chern, Partitions and the maximal excludant, Electron. J. Combin. 28 (2021), no. 3, Paper No. 3.13.arxiv.org/abs/1905.06304
[10]P. J. Grabner, A. Knopfmacher, Analysis of some new partition statistics, Ramanujan J. 12(3) (2006), 439–454.DOI
[11]M. D. Hirschhorn, The power of q. In: Developments in Mathematics,Vol. 49. Springer (2017).
[12]A. E. Ingham, A Tauberian theorem for partitions, Ann. of Math. (2) 42 (1941), 1075–1090.DOI
[13]P. S. Kaur, S. C. Bhoria, P. Eyyunni, B. Maji Minimal excludant over partitions into distinct parts, Int. J. Number Theory, 18 (2022), 2015–2028.
[14]I. Kessler, M. Livingston The expected number of parts in a partition of n, Monatsh. Math. , 81 (1976), 203–212.DOI
[15]N. Koblitz Introduction to Elliptic Curves and Modular Forms, Springer Verlag, New York (1991).
[16]R. da Silva, J. A. Sellers, Parity considerations for mex-related partition functions of Andrews and Newman, J. Integer Seq. 23, no. 5 (2020), Article 20.5.7arxiv.org/abs/2004.02292