Proves that ψ_{2,0}(n) equals twice the sum of bipartition mexes and ψ_{2,1}(n) equals that sum minus the number of equal-mex bipartitions, via combinatorial arguments.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Two-colored generalized Frobenius partitions and minimal-excludant sums over bipartitions
Proves that ψ_{2,0}(n) equals twice the sum of bipartition mexes and ψ_{2,1}(n) equals that sum minus the number of equal-mex bipartitions, via combinatorial arguments.