
AbstractIn this paper, we modify the standard definition of moments of ranks and cranks such that odd moments no longer trivially vanish. Denoting the new k-th rank (resp. crank) moments by N¯k(n) (resp. M¯k(n)), we prove the following inequality between the first rank and crank moments:M¯1(n)>N¯1(n). This inequality motivates us to study a new counting function, ospt(n), which is equal to M¯1(n)−N¯1(n). We also discuss higher order moments of ranks and cranks. Surprisingly, for every higher order moments of ranks and cranks, the following inequality holds:M¯k(n)>N¯k(n). This extends F.G. Garvanʼs result on the ordinary moments of ranks and cranks.
Crank moments, Partitions, Rank, Smallest part function, Theoretical Computer Science, Computational Theory and Mathematics, Crank, Rank moments, Strings, Discrete Mathematics and Combinatorics, :Science::Mathematics::Discrete mathematics::Combinatorics [DRNTU]
Crank moments, Partitions, Rank, Smallest part function, Theoretical Computer Science, Computational Theory and Mathematics, Crank, Rank moments, Strings, Discrete Mathematics and Combinatorics, :Science::Mathematics::Discrete mathematics::Combinatorics [DRNTU]
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 39 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
