On Blecher and Knopfmacher's Fixed Points for Integer Partitions
Abstract
Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions and hypothesized on the relative number of partitions with and without a fixed point. We resolve their open question by working fixed points into a growing number of interconnected partition statistics involving Frobenius symbols, Dyson's crank, and the mex (minimal excluded part). Also, we generalize the definition of fixed points and connect that expanded notion to the mexj defined by Hopkins, Sellers, and Stanton as well as the j-Durfee rectangle defined by Hopkins, Sellers, and Yee.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.