On the number of partitions into parts not congruent to \(0, \pm 3\pmod{12}\) (Q2052779): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10998-020-00374-7 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Mihály Szalay / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Mihály Szalay / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10998-020-00374-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3128896280 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114224918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218535 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3156941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truncated pentagonal number theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truncated theta series and a problem of Guo and Zeng / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity of sums of partition numbers and squares in arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Overpartitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient implementation of the Hardy–Ramanujan–Rademacher formula / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithm for generating ascending compositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: From a Rogers's identity to overpartitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general method for proving the non-trivial linear homogeneous partition inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expansion of the partition functions in a series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rademacher-type formulas for restricted partition and overpartition functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Identities of the Rogers-Ramanujan Type / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10998-020-00374-7 / rank
 
Normal rank

Latest revision as of 21:45, 16 December 2024

scientific article
Language Label Description Also known as
English
On the number of partitions into parts not congruent to \(0, \pm 3\pmod{12}\)
scientific article

    Statements

    On the number of partitions into parts not congruent to \(0, \pm 3\pmod{12}\) (English)
    0 references
    0 references
    27 November 2021
    0 references
    Let \(R(n)\) denote the number of partitions of the positive integer \(n\) into parts not congruent to \(0, \pm 3\pmod{12}\). \textit{A. V. Sills} [Ramanujan J. 23, 253--264 (2010; Zbl 1211.11112)] gave a Rademacher-type formula for \(R(n)\). Computing \(R(n)\) by this formula requires arithmetic with very high-precision approximate real numbers. As to details on how to efficiently implement a Rademacher-type formula see \textit{F. Johansson} [LMS J. Comput. Math. 15, 341--359 (2012; Zbl 1344.11089)].\par In the paper under review the author investigates other relations for computing the value of \(R(n)\). His Theorem 2.1 yields Corollary 2.2 which is a linear recurrence relation for \(R(n)\) involving the generalized pentagonal numbers. Theorem 3.1 yields Corollary 3.2, the following more efficient recurrence relation for computing \(R(n)\): For \(n\ge 0\), \[R(n)+2\sum_{j=1}^{\infty}(-1)^j R(n-2j^2)=\begin{cases} 1, \;\text{if}\; n=k(3k-2)\\0, \;\text{otherwise.}\end{cases}\] The author also derives that \(R(n)\) is odd if and only if \(3n+1\) is a square. According to the proof of Corollary 5.1, \[R(n)=\sum_{k=0}^{\infty}(-1)^{k(k+1)/2}p(n-3k(k+1)/2)\] with the ordinary partition function \(p(n)\), therefore, for \(n\ge 0\), \[\sum_{8k+1\; \text{square}}p(n-3k)\equiv 1 \bmod 2 \] if and only if \(3n+1\) is a square.
    0 references
    integer partitions
    0 references
    partition congruences
    0 references
    triangular numbers
    0 references

    Identifiers