A requested bijective proof of the minimal-excludant theorem, with an r-gap generalization and new truncated-series identities.
Andrews, The Theory of Partitions , Cambridge Math
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Combinatorial Proof of the Minimal Excludant Theorem
A requested bijective proof of the minimal-excludant theorem, with an r-gap generalization and new truncated-series identities.