betaFeedback

WorksMathematics

The minimal excludant of ℓ\ell-regular overpartitions

Abstract

Andrews and Newman \cite{AN1} introduced the minimal excludant (mex) of an integer partition, and Aricheta and Donato \cite{AD} extended it to overpartitions. More recently, Meher \cite{Meher} and Tejash, Bhowmick and Meher \cite{TBM} studied the analogous statistic for ℓ\ell-regular partitions. In this article, for an integer ℓ≥2\ell\ge 2, we define the minimal excludant \omex_\ell(π) of an ℓ\ell-regular overpartition ππ as the smallest positive integer that is not divisible by ℓ\ell and does not occur as a non-overlined part of ππ. We study \sm{\ell}(n), the sum of \omex_\ell(π) over all ℓ\ell-regular overpartitions ππ of nn. We obtain generating functions for \sm{\ell}(n) as eta-quotients for ℓ=2\ell=2 and ℓ=3\ell=3. Later, motivated from \cite{TBM}, we obtained explicit generating functions for \sm{\ell}(n). We show that \sm{\ell}(n) is weakly increasing in nn, and we derive Hardy–Ramanujan type asymptotic formulas for \sm{2}(n) and \sm{3}(n). We then determine the parity of both functions completely: \sm{2}(n) is even for every n≥1n\ge 1, while \sm{3}(n) is odd if and only if n=0n=0 or nn is a centred hexagonal number. Also, we obtain for every ℓ≥3\ell\ge3, \sm{\ell}(n) is odd for infinitely many nn, and the number of such n≤Xn\le X is ≫X\gg\sqrt{X}. Finally, we establish congruences for these functions modulo 33, 44 and 88.

Introduction and Statement of Results

A partition λ=(λ1,λ2,…,λk)\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_k) of a non-negative integer nn is a non-increasing sequence of positive integers summing to nn. Let p(n)p(n) denote the number of partitions of nn. Throughout, for ∣q∣<1|q|<1 we write (a;q)∞:=∏k≥0(1−aqk)(a;q)_\infty:=\prod_{k\ge0}(1-aq^k), and for brevity we set fr:=(qr;qr)∞f_r:=(q^r;q^r)_\infty for every positive integer rr. The generating function of p(n)p(n) is given by

∑n≥0p(n)qn=∏r≥111−qr=1f1.\sum_{n\ge0}p(n)q^n=\prod_{r\ge1}\frac{1}{1-q^r}=\frac{1}{f_1}.

The arithmetic and analytic properties of p(n)p(n) have been studied extensively; see, for example, [1, 14, 17, 27, 29]. Grabner and Knopfmacher [15] introduced and studied the smallest gap of a partition, namely the least positive integer missing from its parts. In 2019, Andrews and Newman [4, 5] rediscovered this statistic under the name minimal excludant, mex⁡(λ)\operatorname{mex}(\lambda). They defined σmex⁡(n):=∑λ⊢nmex⁡(λ)\sigma^{\operatorname{mex}}(n):=\sum_{\lambda\vdash n}\operatorname{mex}(\lambda) and proved

σmex⁡(n)=D2(n),(1)\sigma^{\operatorname{mex}}(n)=D_2(n), \tag*{(1)}

where D2(n)D_2(n) is the number of partitions of nn into distinct parts using two colours. Ballantine and Merca [7] gave a combinatorial proof of (1). Barman and Singh [8, 9] and da Silva and Sellers [13] established congruences and parity results for mex-related partition functions.

An overpartition of nn is a partition of nn in which the first occurrence of each distinct part may be overlined. Let p‾(n)\overline{p}(n) be the number of overpartitions of nn. For example, p‾(3)=8\overline{p}(3)=8:

33, 3‾\overline{3}, 2+12+1, 2‾+1\overline{2}+1, 2+1‾2+\overline{1}, 2‾+1‾\overline{2}+\overline{1}, 1+1+11+1+1, 1‾+1+1\overline{1}+1+1.

The generating function of p‾(n)\overline{p}(n) is given by

∑n≥0p‾(n)qn=∏r≥11+qr1−qr=(−q;q)∞(q;q)∞=f2f12.\sum_{n\ge0}\overline{p}(n)q^n=\prod_{r\ge1}\frac{1+q^r}{1-q^r}=\frac{(-q;q)_\infty}{(q;q)_\infty}=\frac{f_2}{f_1^2}.

Overpartitions were studied systematically by Corteel and Lovejoy [12], and the arithmetic properties of p(n)p(n) have been investigated by many authors; see, for instance, [19, 25]. Aricheta and Donato [6] defined the minimal excludant of an overpartition π\pi as the smallest positive integer that is not a part of the non-overlined parts of π\pi. They proved that σ‾mex(n)=D3(n)\overline{\sigma}\mathrm{mex}(n)=D_3(n), the number of partitions of nn into distinct parts using three colours. They also showed that σ‾mex(n)\overline{\sigma}\mathrm{mex}(n) is odd exactly when nn is a triangular number.

A partition is called ℓ\ell-regular if none of its parts is divisible by ℓ\ell. Let pℓ(n)p_\ell(n) denote the number of ℓ\ell-regular partitions of nn. Then the generating function of pℓ(n)p_\ell(n) is given by

∑n≥0pℓ(n)qn=∏r≥1ℓ∤r11−qr=fℓf1.\sum_{n\geq0}p_\ell(n)q^n=\prod_{\substack{r\geq1\\ \ell\nmid r}}\frac{1}{1-q^r}=\frac{f_\ell}{f_1}.

Divisibility, congruence and parity properties of pℓ(n)p_\ell(n) have been studied, for example, in [14, 20, 24, 28]. Recently Meher [26] defined the minimal excludant of an ℓ\ell-regular partition λ\lambda by mex⁡ℓ(λ):=min⁡{r≥1:ℓ∤r, r∉λ}\operatorname{mex}_\ell(\lambda):=\min\{r\geq1:\ell\nmid r,\ r\notin\lambda\}. He found the generating functions of σℓmex⁡(n)\sigma_\ell^{\operatorname{mex}}(n) for ℓ=2,3\ell=2,3, together with asymptotic formulas. He showed that σ2mex⁡(n)\sigma_2^{\operatorname{mex}}(n) is odd exactly at the generalized pentagonal numbers, and that σ3mex⁡(n)\sigma_3^{\operatorname{mex}}(n) is odd for ≫log⁡log⁡X\gg\log\log X values of n≤Xn\leq X. Motivated by these results, we study the minimal excludant of ℓ\ell-regular overpartitions.

Let ℓ≥2\ell\geq2 be a positive integer. An overpartition is ℓ\ell-regular if none of its parts, overlined or not, is divisible by ℓ\ell. Let P‾ℓ(n)\overline{\mathcal{P}}_\ell(n) denote the set of all ℓ\ell-regular overpartitions of nn, and p‾ℓ(n):=∣P‾ℓ(n)∣\overline{p}_\ell(n):=|\overline{\mathcal{P}}_\ell(n)|. The overlined parts of an ℓ\ell-regular overpartition form a partition into distinct parts not divisible by ℓ\ell, and the non-overlined parts form an ℓ\ell-regular partition. Since

∏r≥1ℓ∤r(1+qr)=(−q;q)∞(−qℓ;qℓ)∞=f2f1⋅fℓf2ℓ,\prod_{\substack{r\geq1\\ \ell\nmid r}}(1+q^r)=\frac{(-q;q)_\infty}{(-q^\ell;q^\ell)_\infty}=\frac{f_2}{f_1}\cdot\frac{f_\ell}{f_{2\ell}},

the generating function of p‾ℓ(n)\overline{p}_\ell(n) is given by

P‾ℓ(q):=∑n≥0p‾ℓ(n)qn=∏r≥1ℓ∤r1+qr1−qr=f2fℓ2f12f2ℓ.\overline{P}_\ell(q):=\sum_{n\geq0}\overline{p}_\ell(n)q^n=\prod_{\substack{r\geq1\\ \ell\nmid r}}\frac{1+q^r}{1-q^r}=\frac{f_2f_\ell^2}{f_1^2f_{2\ell}}.

In particular, P‾2(q)=f23f12f4\overline{P}_2(q)=\frac{f_2^3}{f_1^2f_4} and P‾3(q)=f2f32f12f6\overline{P}_3(q)=\frac{f_2f_3^2}{f_1^2f_6}. The function p‾ℓ(n)\overline{p}_\ell(n) was introduced by Lovejoy [23], and its arithmetic properties have been studied in [2, 11, 16, 30]. For π∈P‾ℓ(n)\pi\in\overline{\mathcal{P}}_\ell(n), the ℓ\ell-regular minimal excludant is defined by

mex⁡‾ℓ(π):=min⁡{r≥1:ℓ∤r, r is not a non-overlined part of π}.\overline{\operatorname{mex}}_\ell(\pi):=\min\{r\geq1:\ell\nmid r,\ r\text{ is not a non-overlined part of }\pi\}.

In other words, mex⁡‾ℓ(π)\overline{\operatorname{mex}}_\ell(\pi) is the smallest positive integer that is not divisible by ℓ\ell and does not occur as a non-overlined part of π\pi. Overlined parts play no role in mex⁡‾ℓ(π)\overline{\operatorname{mex}}_\ell(\pi). We call a positive integer admissible if it is not divisible by ℓ\ell. Thus every part of an ℓ\ell-regular overpartition, overlined or not, is admissible, and mex⁡‾ℓ(π)\overline{\operatorname{mex}}_\ell(\pi) is the smallest admissible integer that does not occur as a non-overlined part of π\pi. Let mm be a positive integer such that ℓ∤m\ell\nmid m. We define

p‾ℓmex⁡(m,n):=#{π∈P‾ℓ(n):mex⁡‾ℓ(π)=m}.\overline{p}^{\operatorname{mex}}_\ell(m,n):=\#\{\pi\in\overline{\mathcal{P}}_\ell(n):\overline{\operatorname{mex}}_\ell(\pi)=m\}.

If ℓ∣m\ell\mid m, then p‾ℓmex⁡(m,n)=0\overline{p}^{\operatorname{mex}}_\ell(m,n)=0 by convention. We consider some examples to understand the above definitions.

Example 1. Let ℓ=4\ell=4 and n=6n=6. The admissible parts are 1,2,3,5,6,7,9,10,11,…1,2,3,5,6,7,9,10,11,\ldots

References

  1. [1]S. Ahlgren and K. Ono, Congruence properties for the partition function, Proc. Natl. Acad. Sci. USA 98 (2001), no. 23, 12882–12884.pubmed.ncbi.nlm.nih.gov/11606715
  2. [2]A. M. Al. A. O. Munagi and J. A. Sellers, An infinite family of congruences for ℓ-regular overpartitions, Integers 16 (2016), Paper No. A37.
  3. [3]G. E. Andrews, The Theory of Partitions, Reprint of the 1976 original, Cambridge University Press, Cambridge, 1998.
  4. [4]G. E. Andrews and D. Newman, Partitions and the minimal excludant, Ann. Comb. 23 (2019), no. 2, 249–254.DOI
  5. [5]G. E. Andrews and D. Newman, The minimal excludant in integer partitions, J. Integer Seq. 23 (2020), Article 20.2.3.
  6. [6]V. M. R. Aricheta and J. A. L. Donato, A minimal excludant over overpartitions, J. Integer Seq. 27 (2024), Article 24.7.1.arxiv.org/abs/2309.04398
  7. [7]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
  8. [8]R. Barman and A. Singh, On mex-related partition functions of Andrews and Newman, Res. Number Theory 7 (2021), Paper No. 53.
  9. [9]R. Barman and A. Singh, Mex-related partition functions of Andrews and Newman, J. Integer Seq. 24 (2021), Article 21.6.3.
  10. [11]S. Chern, New congruences for ℓ-regular overpartitions, Integers 17 (2017), Paper No. A22.DOI
  11. [12]S. Corteel and J. Lovejoy, Overpartitions, Trans. Amer. Math. Soc. 356 (2004), no. 4, 1623–1635.
  12. [13]R. da Silva and J. A. Sellers, Parity considerations for mex-related partition functions of Andrews and Newman, J. Integer Seq. 23 (2020), Article 20.5.7.
  13. [14]B. Gordon and K. Ono, Divisibility of certain partition functions by powers of primes, Ramanujan J. 1 (1997), 25–34.DOI
  14. [15]P. J. Grabner and A. Knopfmacher, Analysis of some new partition statistics, Ramanujan J. 12 (2006), no. 3, 439–454.DOI
  15. [16]R. X. J. Hao and E. Y. Y. Shen, On the number of ℓ-regular overpartitions, Int. J. Number Theory 17 (2021), no. 9, 2153–2173.DOI
  16. [17]G. H. Hardy and S. Ramanujan, Asymptotic formulae in combinatory analysis, Proc. London Math. Soc. (2) 17 (1918), 75–115.
  17. [18]M. D. Hirschhorn, The Power of q, Developments in Mathematics, Vol. 49, Springer, 2017.
  18. [19]M. D. Hirschhorn and J. A. Sellers, Arithmetic relations for overpartitions, J. Combin. Math. Combin. Comput. 53 (2005), 65–73.
  19. [20]M. D. Hirschhorn and J. A. Sellers, Elementary proofs of parity results for 5-regular partitions, Bull. Aust. Math. Soc. 81 (2010), no. 1, 58–63.
  20. [21]A. E. Ingham, A Tauberian theorem for partitions, Ann. of Math. (2) 42 (1941), 1075–1090.DOI
  21. [22]N. Koblitz, Introduction to Elliptic Curves and Modular Forms, Springer-Verlag, New York, 1991.
  22. [23]J. Lovejoy, Gordon’s theorem for overpartitions, J. Combin. Theory Ser. A 103 (2003), no. 2, 393–401.DOI
  23. [24]J. Lovejoy and D. Penniston, 3-regular partitions and a modular K3 surface, Contemp. Math. 291 (2001), 177–182.
  24. [25]K. Mahlburg, The overpartition function modulo small powers of 2, Discrete Math. 286 (2004), no. 3, 263–267.
  25. [26]N. K. Meher, The minimal excludant of ℓ-regular partition, preprint, arXiv:2611.06072.
  26. [27]K. Ono, Distribution of the partition function modulo m, Ann. of Math. (2) 151 (2000), 293–307.
  27. [28]D. Penniston, Arithmetic of ℓ-regular partition functions, Int. J. Number Theory 4 (2008), no. 2, 295–302.DOI
  28. [29]S. Ramanujan, Some properties of p(n), the number of partitions of n, Proc. Cambridge Philos. Soc. 19 (1919), 207–210.
  29. [30]E. Y. Y. Shen, Arithmetic properties of ℓ-regular overpartitions, Int. J. Number Theory 12 (2016), no. 3, 841–852.DOI
  30. [31]P. Tejash, S. Bhowmick and N. K. Meher, The minimal excludant and the least r-gaps of ℓ-regular partitions, preprint, arXiv:2611.07871.

Paper details

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

views · 2

downloads · 0

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