On Blecher and Knopfmacher's Fixed Points for Integer Partitions
Combinatorics
2024-05-21 v1
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 defined by Hopkins, Sellers, and Stanton as well as the -Durfee rectangle defined by Hopkins, Sellers, and Yee.
Keywords
Cite
@article{arxiv.2305.05096,
title = {On Blecher and Knopfmacher's Fixed Points for Integer Partitions},
author = {Brian Hopkins and James A. Sellers},
journal= {arXiv preprint arXiv:2305.05096},
year = {2024}
}
Comments
13 pages, 7 figures, 1 table