on the distribution of the spt-crank

Clicks: 82
ID: 193285
2013
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #42 of 55 articles by views in Turkish journal of pharmaceutical sciences

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
Andrews, Garvan and Liang introduced the spt-crank for vector partitions. We conjecture that for any n the sequence {NS (m, n)}m is unimodal, where NS (m, n) is the number of S-partitions of size n with crank m weight by the spt-crank. We relate this conjecture to a distributional result concerning the usual rank and crank of unrestricted partitions. This leads to a heuristic that suggests the conjecture is true and allows us to asymptotically establish the conjecture. Additionally, we give an asymptotic study for the distribution of the spt-crank statistic. Finally, we give some speculations about a definition for the spt-crank in terms of “marked” partitions. A “marked” partition is an unrestricted integer partition where each part is marked with a multiplicity number. It remains an interesting and apparently challenging problem to interpret the spt-crank in terms of ordinary integer partitions.
Reference Key
rhoades2013mathematicson Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;Robert C. Rhoades;Freeman J. Dyson;George E. Andrews
Journal Turkish journal of pharmaceutical sciences
Year 2013
DOI
10.3390/math1030076
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.