On the number of parts in congruence classes for partitions into distinct parts (Q2164876)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the number of parts in congruence classes for partitions into distinct parts |
scientific article |
Statements
On the number of parts in congruence classes for partitions into distinct parts (English)
0 references
18 August 2022
0 references
By means of the circle method, an asymptotic formula for the total number of parts congruent to \(r\) modulo \(t\) in a partition of \(n\) into distinct parts is proven: specifically, if \(D_{r,t}(n)\) denotes this number, we have \[ D_{r,t}(n) = \frac{3^{1/4}e^{\pi \sqrt{n/3}}}{2\pi t n^{1/4}} \Big( \log 2 + \Big( \frac{\sqrt{3} \log 2}{8\pi} - \frac{\pi}{4\sqrt{3}} \Big(r - \frac{t}{2} \Big) \Big) n^{-1/2} + o(n^{-1/2}) \Big). \] It follows from this formula that \(D_{r,t}(n) \geq D_{s,t}(n)\) for sufficiently large \(n\) whenever \(0 < r < s \leq t\). This statement is made effective by deriving an explicit error term in the asymptotic formula and using it to show that the inequality holds for all \(n > 8\) if \(2 \leq t \leq 10\).
0 references
parts in partitions
0 references
distinct parts
0 references
asymptotics
0 references
circle method
0 references
0 references