New congruences modulo 2, 4, and 8 for the number of tagged parts over the partitions with designated summands (Q2181581): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
(One intermediate revision by one other user not shown) | |||
Property / DOI | |||
Property / DOI: 10.1007/s11139-018-0112-x / rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q128177733 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1007/S11139-018-0112-X / rank | |||
Normal rank |
Latest revision as of 09:26, 17 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | New congruences modulo 2, 4, and 8 for the number of tagged parts over the partitions with designated summands |
scientific article |
Statements
New congruences modulo 2, 4, and 8 for the number of tagged parts over the partitions with designated summands (English)
0 references
19 May 2020
0 references
\textit{G. E. Andrews} et al. [Acta Arith. 105, No. 1, 51--66 (2002; Zbl 1004.05006)] introduced and studied a new class of partitions, partitions with designated summands. In such partitions, among parts with equal size exactly one is designated or tagged. Recently, \textit{B. L. S. Lin} [J. Number Theory 184, 216--234 (2018; Zbl 1375.05021)] introduced the partition functions \(PD_t(n)\) and \(PDO_t(n)\), which count the total number of tagged parts over all partitions of \(n\) with designated summand and the total number of tagged parts over all partitions of \(n\) with designated summands in which all parts are odd. Lin [loc. cit.] also proved some congruences modulo small powers of 3 for \(PD_t(n)\) and \(PDO_t(n)\), and conjectured that, for any nonnegative integer \(n\), \(PD_t(48n+28)\equiv PD_t(48n+46)\equiv 0\pmod 8\) and \(PDO_t(8n+6)\equiv PDO_t(8n+7)\equiv 0\pmod 8\). In the paper under review, the authors prove the above congruences and also find many new congruences and infinite families of congruences modulo 2 and 4.
0 references
partitions with designated summands
0 references
tagged part
0 references
dissection formula
0 references
congruence
0 references
0 references