The minimal excludant and the least r-gaps of-regular partitions

arXiv:2611.07871 · math.NT · Submitted 2026-11-05 · Read on arXiv

math.NT

Submitted: 2026-11-05

Updated: 2026-11-05

Comments: 22 pages, first draft of the paper

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

The gist: The minimal excludant (mex) of an integer partition λ is the smallest positive integer that is not a part of λ.

Terminology

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-regular partitions with at least2, that is, partitions in which no part is divisible by. Recently, Meher defined the minimal excludant for-regular partitions. Motivated by Meher, for an-regular partition we define its least r-gap as the smallest positive integer not divisible by that appears fewer than r times as a part, and we obtain the two-variable generating function for the number of-regular partitions of n with a given least r-gap. Let σ(n), and σ,r(n) be the sum of the of the mex values over all-regular partitions of n and least r-gaps over all-regular partitions of n respectively. Using Jacobi's triple product identity, we derive explicit expressions for the generating function of σ(n), and σ,r(n), with separate formulas for even and odd. We also show that the sequence σ,r(n) n at least0 is weakly increasing for every at least2 and r at least1. Also, using Ingham's Tauberian theorem, we establish Hardy--Ramanujan type asymptotic formulas for σ,r(n) when =4,5,7 and r at least1 is arbitrary. Lastly, we prove σ,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.

Sources

Related papers