Asymptotic equidistribution and convexity for partition ranks (Q829696): Difference between revisions
From MaRDI portal
Changed an Item |
Created claim: Wikidata QID (P12): Q126302048, #quickstatements; #temporary_batch_1719270238695 |
||
Property / Wikidata QID | |||
Property / Wikidata QID: Q126302048 / rank | |||
Normal rank |
Revision as of 01:04, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotic equidistribution and convexity for partition ranks |
scientific article |
Statements
Asymptotic equidistribution and convexity for partition ranks (English)
0 references
6 May 2021
0 references
In [in: Ramanujan revisited, Proc. Conf., Urbana-Champaign/Illinois 1987, 7--28 (1988; Zbl 0652.10009)], \textit{F. J. Dyson} defined the rank of an integer partition to be its largest part minus its number of parts. The number of partitions of \(n\) with rank congruent to \(r\) modulo \(t\) is denoted by \(N(r,t;n)\). In this paper, the author investigates the partition rank function \(N(r,t;n)\) and proves a conjecture of \textit{E. Hou} and \textit{M. Jagadeesan} [Ramanujan J. 45, No. 3, 817--839 (2018; Zbl 1459.11206)] on the convexity of \(N(r, t; n)\): For \(0 \leq r < t\) and \(t \geq 2\) then \[N(r, t; a)N(r, t; b) > N(r, t; a + b)\] for sufficiently large \(a\) and \(n\).
0 references
partitions
0 references
partition rank
0 references
asymptotics
0 references
Appell function
0 references