betaFeedback

WorksMathematics

The minimal excludant and the least rr-gaps of ℓ\ell-regular partitions

Abstract

The minimal excludant (mex) of an integer partition λλ is the smallest positive integer that is not a part of λλ. In this paper we study an analogue of this statistic for ℓ\ell-regular partitions with ℓ≥2\ell\geq2, that is, partitions in which no part is divisible by ℓ\ell. Recently, Meher \cite{Meher} defined the minimal excludant for ℓ\ell-regular partitions. Motivated by Meher \cite{Meher}, for an ℓ\ell-regular partition we define its least rr-gap as the smallest positive integer not divisible by ℓ\ell that appears fewer than rr times as a part, and we obtain the two-variable generating function for the number of ℓ\ell-regular partitions of nn with a given least rr-gap. Let σ^{\mex}_{\ell}(n), and σ^{\mex}_{\ell,r}(n) be the sum of the of the mex values over all ℓ\ell-regular partitions of nn and least rr-gaps over all ℓ\ell-regular partitions of nn respectively. Using Jacobi's triple product identity, we derive explicit expressions for the generating function of σ^{\mex}_{\ell}(n), and σ^{\mex}_{\ell,r}(n), with separate formulas for even and odd ℓ\ell. We also show that the sequence \{σ^{\mex}_{\ell,r}(n)\}_{n\ge0} is weakly increasing for every ℓ≥2\ell\ge2 and r≥1r\ge1. Also, using Ingham's Tauberian theorem, we establish Hardy–Ramanujan type asymptotic formulas for σ^{\mex}_{\ell,r}(n) when ℓ=4,5,7\ell=4,5,7 and r≥1r\ge1 is arbitrary. Lastly, we prove σ^{\mex}_{\ell,r} 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 log log X.

Introduction

A partition of a positive integer nn is a non-increasing sequence of positive integers, called parts, whose sum is nn. Following Andrews and Newman [2], the minimal excludant of a partition λ\lambda, denoted mex⁡(λ)\operatorname{mex}(\lambda), is the smallest positive integer that does not appear as a part of λ\lambda. This statistic had earlier been studied by Grabner and Knopfmacher [8] under the name “smallest gap”. Writing

σmex⁡(n)=∑λ⊢nmex⁡(λ),\sigma^{\operatorname{mex}}(n)=\sum_{\lambda\vdash n}\operatorname{mex}(\lambda),

Andrews and Newman [2] proved that

∑n≥0σmex⁡(n)qn=(−q;q)∞2,\sum_{n\ge0}\sigma^{\operatorname{mex}}(n)q^n=(-q;q)^2_\infty,

so that σmex⁡(n)\sigma^{\operatorname{mex}}(n) equals the number of partitions of nn into distinct parts using two colors. Since then the minimal excludant and its generalizations have attracted considerable attention; see, for instance, Hopkins, Sellers and Stanton [9], who connected the minimal excludant to Dyson’s crank, and the references therein. For more details about minimal excludant one can see [5], [6], and [11].

2020 Mathematics Subject Classification. 05A17, 11P81, 11P83.

Key words and phrases. Partitions, ℓ\ell-regular partitions, minimal excludant, least rr-gap, generating functions, Jacobi triple product Identity.

Throughout, we use the standard qq-Pochhammer notation

(a;q)∞=∏k≥0(1−aqk),fk:=(qk;qk)∞.(a;q)_{\infty}=\prod_{k\geq0}(1-aq^k),\qquad f_k:=(q^k;q^k)_{\infty}.

and we assume ∣q∣<1|q|<1. For an integer ℓ≥2\ell\geq2, a partition is called ℓ\ell-regular if none of its parts is divisible by ℓ\ell. Let Pℓ(n)\mathcal{P}_{\ell}(n) denote the set of all ℓ\ell-regular partitions of nn. The generating function for ℓ\ell-regular partitions is fℓ/f1f_{\ell}/f_1.

Very recently, Meher [12] introduced the minimal excludant of an ℓ\ell-regular partition. Since multiples of ℓ\ell can never occur as parts of an ℓ\ell-regular partition, he defined, for λ∈Pℓ(n)\lambda\in\mathcal{P}_{\ell}(n),

mex⁡ℓ(λ):=min⁡{m≥1:ℓ∤m, m∉λ},σℓmex⁡(n):=∑λ∈Pℓ(n)mex⁡ℓ(λ).\operatorname{mex}_{\ell}(\lambda):=\min\{m\geq1:\ell\nmid m,\ m\notin\lambda\},\qquad\sigma_{\ell}^{\operatorname{mex}}(n):=\sum_{\lambda\in\mathcal{P}_{\ell}(n)}\operatorname{mex}_{\ell}(\lambda).

In [12], the author obtained explicit eta-quotient representations of the generating function of σℓmex⁡(n)\sigma_{\ell}^{\operatorname{mex}}(n) for ℓ=2\ell=2 and ℓ=3\ell=3. Also the author established Hardy–Ramanujan type asymptotic formulas for σ2mex⁡(n)\sigma_{2}^{\operatorname{mex}}(n) and σ3mex⁡(n)\sigma_{3}^{\operatorname{mex}}(n) and then showed that σ2mex⁡(n)\sigma_{2}^{\operatorname{mex}}(n) is odd precisely at the generalized pentagonal numbers. More generally, σ3mex⁡(n)\sigma_{3}^{\operatorname{mex}}(n) is odd infinitely often, with at least ≫log⁡log⁡X\gg\log\log X such n≤Xn\leq X. He also suggested extending these results to ℓ≥4\ell\geq4.

Ballantine and Merca [4] generalized mex⁡(λ)\operatorname{mex}(\lambda) to rr-mex⁡(λ)\operatorname{mex}(\lambda), which is the least positive integer that does not occur at least rr times as a part of λ\lambda (so 11-mex⁡(λ)=mex⁡(λ)\operatorname{mex}(\lambda)=\operatorname{mex}(\lambda)), where r∈Nr\in\mathbb{N}. For more details about rr-mex⁡(λ)\operatorname{mex}(\lambda) one can read [7]. Motivated by Ballantine and Merca [4] and Meher [12], for a positive integer rr we define the following-

Definition 1.1. For an ℓ\ell-regular partition λ\lambda, the mex⁡ℓ,r(λ)\operatorname{mex}_{\ell,r}(\lambda) is the smallest positive integer mm with ℓ∤m\ell\nmid m that appears fewer than rr times as a part of λ\lambda. Let pℓ,rmex⁡(m,n)p_{\ell,r}^{\operatorname{mex}}(m,n) be the number of ℓ\ell-regular partitions of nn with rr-gap mm, and

σℓ,rmex⁡(n)=∑λmex⁡ℓ,r(λ),\sigma_{\ell,r}^{\operatorname{mex}}(n)=\sum_{\lambda}\operatorname{mex}_{\ell,r}(\lambda),

the sum over all ℓ\ell-regular partitions λ\lambda of nn. For r=1r=1 these are pℓmex⁡(m,n)p_{\ell}^{\operatorname{mex}}(m,n) and σℓmex⁡(n)\sigma_{\ell}^{\operatorname{mex}}(n).

Throughout, we write

Aℓ(m):=∑1≤j<mℓ∤jj,Bℓ(m):=∑1≤j<mℓ∤j(r⋅j)=rAℓ(m).A_{\ell}(m):=\sum_{\substack{1\leq j<m\\ \ell\nmid j}}j,\qquad B_{\ell}(m):=\sum_{\substack{1\leq j<m\\ \ell\nmid j}}(r\cdot j)=rA_{\ell}(m).

Our first theorem gives the generating function of σℓmex⁡(n)\sigma_{\ell}^{\operatorname{mex}}(n) as a finite sum of infinite products.

Theorem 1.2. Let ℓ≥2\ell\geq2 be an integer. Then we have two cases

If ℓ\ell is even, then

∑n≥0σℓmex⁡(n)qn=fℓfℓ(ℓ−1)f1∑s=1ℓ/2qs(s−1)2(−qℓ(ℓ+2s−3)2;qℓ(ℓ−1))∞(−qℓ(ℓ−2s+1)2;qℓ(ℓ−1))∞.\sum_{n\geq0}\sigma_{\ell}^{\operatorname{mex}}(n)q^n =\frac{f_{\ell}f_{\ell(\ell-1)}}{f_1} \sum_{s=1}^{\ell/2}q^{\frac{s(s-1)}{2}} \left(-q^{\frac{\ell(\ell+2s-3)}{2}};q^{\ell(\ell-1)}\right)_{\infty} \left(-q^{\frac{\ell(\ell-2s+1)}{2}};q^{\ell(\ell-1)}\right)_{\infty}.

If ℓ\ell is odd, then

∑n≥0σℓmex(n)qn=fℓfℓ(ℓ−1)f1[∑s=1(ℓ−1)/2qs(s−1)/2(−qℓ(ℓ+2s−3)/2;qℓ(ℓ−1))∞(−qℓ(ℓ−2s+1)/2;qℓ(ℓ−1))∞+q(ℓ2−1)/8f2ℓ(ℓ−1)2fℓ(ℓ−1)2].\sum_{n\ge0}\sigma_{\ell}^{\mathrm{mex}}(n)q^n = \frac{f_{\ell}f_{\ell(\ell-1)}}{f_1} \left[ \sum_{s=1}^{(\ell-1)/2} q^{s(s-1)/2} \left(-q^{\ell(\ell+2s-3)/2};q^{\ell(\ell-1)}\right)_{\infty} \left(-q^{\ell(\ell-2s+1)/2};q^{\ell(\ell-1)}\right)_{\infty} + q^{(\ell^2-1)/8} \frac{f_{2\ell(\ell-1)}^2}{f_{\ell(\ell-1)}^2} \right].

More generally, for an arbitrary r≥1r\ge1 we prove the following.

References

  1. [1]G. E. Andrews, The Theory of Partitions, Reprint of the 1976 original, Cambridge University Press, Cambridge, 1998.
  2. [2]G. E. Andrews and D. Newman, Partitions and the minimal excludant, Ann. Comb. 23 (2019), no. 2, 249–254.DOI
  3. [3]T. M. Apostol, Modular Functions and Dirichlet Series in Number Theory, 2nd ed., Graduate Texts in Mathematics 41, Springer-Verlag, New York, 1990.
  4. [4]C. Ballantine and M. Merca, Combinatorial proof of the minimal excludant theorem, Int. J. Number Theory 17 (2021), no. 8, 1765–1779.arxiv.org/abs/1908.06789
  5. [5]R. Barman and A. Singh, On mex-related partition functions of Andrews and Newman, Res. Number Theory 7 (2021), Paper No. 53.arxiv.org/abs/2009.11602
  6. [6]R. Barman and A. Singh, Mex-related partition functions of Andrews and Newman, J. Integer Seq. 24 (2021), Article 21.6.3.arxiv.org/abs/2009.11602
  7. [7]N. D. Baruah and P. Talukdar, Arithmetic and asymptotic properties for some functions related to the least r-gaps of partitions, Ann. Comb. 30 (2026), 526–551.DOI
  8. [8]P. J. Grabner and A. Knopfmacher, Analysis of some new partition statistics, Ramanujan J. 12 (2006), no. 3, 439–454.DOI
  9. [9]B. Hopkins, J. A. Sellers and D. Stanton, Dyson's crank and the mex of integer partitions, J. Combin. Theory Ser. A 185 (2022), 105523.DOI
  10. [10]A. E. Ingham, A Tauberian theorem for partitions, Ann. of Math. (2) 42 (1941), 1075–1090.DOI
  11. [11]P. S. Kaur, S. C. Bhoria, P. Eyyunni and B. Maji, Minimal excludant over partitions into distinct parts, Int. J. Number Theory 18 (2022), 2015–2028.
  12. [12]N. K. Meher, The minimal excludant of ℓ-regular partition, preprint, arXiv:2611.06072.

Paper details

vlnc:W_uh6rufa2
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 11

downloads · 2

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents