Divisibility and distribution of MEX related integer partitions of Andrews and Newman

From MaRDI portal
Publication:6428983

DOI10.1142/S1793042123500288arXiv2303.05332WikidataQ114071746 ScholiaQ114071746MaRDI QIDQ6428983FDOQ6428983


Authors: Chiranjit Ray Edit this on Wikidata


Publication date: 9 March 2023

Abstract: Andrews and Newman introduced the minimal excludant or ``mex function for an integer partition pi of a positive integer n, mex(pi), as the smallest positive integer that is not a part of pi. They defined sigmamex(n) to be the sum of mex(pi) taken over all partitions pi of n. We prove infinite families of congruence and multiplicative formulas for sigmamex(n). By restricting to the part of pi, Andrews and Newman also introduced moex(pi) to be the smallest odd integer that is not a part of pi and sigmamoex(n) to be the sum of moex(pi) taken over all partitions pi of n. In this article, we show that for any sufficiently large X, the number of all positive integer nleqX such that sigmamoex(n) is an even (or odd) number is at least mathcalO(loglogX).













This page was built for publication: Divisibility and distribution of $MEX$ related integer partitions of Andrews and Newman

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6428983)