A new generalization of the minimal excludant arising from an analogue of Franklin's identity

preprint2022arXivOpen access

Abstract

Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering partitions with exactly jj different multiples of rr, for a positive integer rr. We prove an analogue of Franklin's identity by studying the number of partitions with jj multiples of rr in total and in the process, discover a natural generalization of the minimal excludant (mex) which we call the rr-chain mex. Further, we derive the generating function for σrcmex(n)σ_{rc} \textup{mex}(n), the sum of rr-chain mex taken over all partitions of nn, thereby deducing a combinatorial identity for σrcmex(n)σ_{rc} \textup{mex}(n), which neatly generalizes the result of Andrews and Newman for σmex(n)σ\textup{mex}(n), the sum of mex over all partitions of nn.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.