{"title":"A Bijective Proof of a Generalization of the Non-Negative Crank-Odd Mex Identity","authors":"Isaac Konan","doi":"10.37236/11472","DOIUrl":null,"url":null,"abstract":"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 give a bijective proof of a generalization of this identity provided by Hopkins, Sellers and Stanton. Our method uses an alternative definition of the Durfee decomposition, whose combinatorial link to the crank was recently studied by Hopkins, Sellers, and Yee.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"14 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.37236/11472","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
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 give a bijective proof of a generalization of this identity provided by Hopkins, Sellers and Stanton. Our method uses an alternative definition of the Durfee decomposition, whose combinatorial link to the crank was recently studied by Hopkins, Sellers, and Yee.
期刊介绍:
The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.