Arithmetic properties and asymptotic formulae for σomex(n) and σemex(n)

Abstract

The minimal excludant of an integer partition is the least positive integer missing from the partition. Let σomex(n) (resp., σemex(n)) denote the sum of odd (resp., even) minimal excludants over all the partitions of n. Recently, Baruah et al. proved a few congruences for these partition functions modulo 4 and 8, and asked for asymptotic formulae for the same. In this article, we study the lacunarity of σomex(n) and σemex(n) modulo arbitrary powers of 2 and also prove some infinite families of congruences for σomex(n) and σemex(n) modulo 4 and 8. We also obtain Hardy-Ramanujan type asymptotic formulae for both σomex(n) and σemex(n).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…