A refinement of a result of Andrews and Newman on the sum of minimal excludants

In 2019, Andrews and Newman [‘Partitions and the minimal excludant’, Ann. Comb.23(2) (2019), 249–254] introduced the arithmetic function $\sigma \textrm {mex}(n)$ , which denotes the sum of minimal excludants over all the partitions of n. Baruah et al. [‘A refinement of a result of Andrews and Newman on the sum of minimal excludants’, Ramanujan J., to appear] showed that the sum of minimal excludants over all the partitions of n is the same as the number of partition pairs of n into distinct parts. They proved three congruences modulo $4$ and $8$ for two functions appearing in this refinement and conjectured two further congruences modulo $8$ and $16$ . We confirm these two conjectures by using q-series manipulations and modular forms.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A refinement of a result of Andrews and Newman on the sum of minimal excludants

Cited by 2 publications

References 10 publications

Arithmetic properties and asymptotic formulae for $$\sigma _o\text {mex}(n)$$ and $$\sigma _e\text {mex}(n)$$

Arithmetic properties and asymptotic formulae for $$\sigma _o\text {mex}(n)$$ and $$\sigma _e\text {mex}(n)$$

On a Conjecture for a Refinement of the Sum of Minimal Excludants

Contact Info

Product

Resources

About