A Stanley–Elder theorem on Cranks and Frobenius symbols
The Stanley–Elder theorem asserts that the number of j’s in the partitions of n is equal to the number of parts that appear at least j times in a given partition of n, summed over all partitions of n. In this paper, we prove that the number of partitions of n with crank > j equals to half the total number of j’s in the Frobenius symbols for n.
This version of the article has been accepted for publication, after peer review (when applicable) and is subject to Springer Nature’s AM terms of use, but is not the Version of Record and does not reflect post-acceptance improvements, or any corrections. The Version of Record is available online at: http://dx.doi.org/10.1007/s40993-021-00285-7
Files
Metadata
Work Title | A Stanley–Elder theorem on Cranks and Frobenius symbols |
---|---|
Access | |
Creators |
|
Keyword |
|
License | In Copyright (Rights Reserved) |
Work Type | Article |
Publisher |
|
Publication Date | August 18, 2021 |
Publisher Identifier (DOI) |
|
Deposited | August 03, 2022 |
Versions
Analytics
Collections
This resource is currently not in any collection.