Abstract
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.
Original language | English (US) |
---|---|
Article number | 56 |
Journal | Research in Number Theory |
Volume | 7 |
Issue number | 3 |
DOIs | |
State | Published - Sep 2021 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory