arXiv:2203.04267 [math.CO]AbstractReferencesReviewsResources
A bijective proof and generalization of the non-negative crank--odd mex identity
Published 2022-03-08Version 1
Recent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between two partition statistics, the crank and the mex. They state that, for a positive integer $n$, there are as many partitions of $n$ with non-negative crank as partitions of $n$ with odd mex. In this paper, we provide a generalization of this identity and prove it bijectively. Our method uses an alternative definition of the Durfee decomposition, whose combinatorial link to the crank was recently studied by Hopkins, Sellers, and Yee.
Comments: 11 pages
Related articles: Most relevant | Search more
arXiv:1906.00089 [math.CO] (Published 2019-05-31)
A bijective proof and generalization of Siladić's Theorem
arXiv:1005.4256 [math.CO] (Published 2010-05-24)
Bijective Proofs of Gould's and Rothe's Identities
Proofs of Two Formulas of Vladeta Jovovic