# Combinatorial Proof of the Minimal Excludant Theorem

## TL;DR

This paper provides a combinatorial proof for a theorem relating the sum of minimal excludants of partitions to partitions into distinct parts with two colors, and extends the interpretation to a generalized concept involving least r-gaps.

## Contribution

It offers a purely combinatorial proof of the minimal excludant theorem and introduces a generalization involving least r-gaps in partitions.

## Key findings

- Established a combinatorial proof for the minimal excludant sum theorem.
- Extended the interpretation to least r-gaps in partitions.
- Derived new properties of the function σ_mex(n).

## Abstract

The minimal excludant of a partition $\lambda$, $\rm{mex}(\lambda)$, is the smallest positive integer that is not a part of $\lambda$. For a positive integer $n$, $ \sigma\, \rm{mex}(n)$ denotes the sum of the minimal excludants of all partitions of $n$. Recently, Andrews and Newman obtained a new combinatorial interpretations for $\sigma\, \rm{mex}(n)$. They showed, using generating functions, that $\sigma\, \rm{mex}(n)$ equals the number of partitions of $n$ into distinct parts using two colors. In this paper, we provide a purely combinatorial proof of this result and new properties of the function $\sigma\, \rm{mex}(n)$. We generalize this combinatorial interpretation to $\sigma_r\, \rm{mex}(n)$, the sum of least $r$-gaps in all partitions of $n$. The least $r$-gap of a partition $\lambda$ is the smallest positive integer that does not appear at least $r$ times as a part of $\lambda$.