Partitions With Designated Summands Not Divisible by $2^l$, $2$, and $3^l$ Modulo $2$, $4$, and $3$
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2021
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916338236129280 |
|---|---|
| author | Herden, Daniel Sepanski, Mark R. Stanfill, Jonathan Hammon, Cordell Henningsen, Joel Ickes, Henry Ruiz, Indalecio |
| author_facet | Herden, Daniel Sepanski, Mark R. Stanfill, Jonathan Hammon, Cordell Henningsen, Joel Ickes, Henry Ruiz, Indalecio |
| contents | Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands whose parts are not divisible by $2^\ell$, $2$, and $3^\ell$ working modulo $2,\ 4,$ and $3$, respectively, greatly extending previous results on the subject. We provide a few applications of our characterizations throughout in the form of congruences and a computationally fast recurrence. Moreover, we illustrate a previously undocumented connection between the number of partitions with designated summands and the number of partitions with odd multiplicities. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2101_04058 |
| institution | arXiv |
| publishDate | 2021 |
| record_format | arxiv |
| spellingShingle | Partitions With Designated Summands Not Divisible by $2^l$, $2$, and $3^l$ Modulo $2$, $4$, and $3$ Herden, Daniel Sepanski, Mark R. Stanfill, Jonathan Hammon, Cordell Henningsen, Joel Ickes, Henry Ruiz, Indalecio Combinatorics Primary: 11P83, Secondary: 05A17 Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands whose parts are not divisible by $2^\ell$, $2$, and $3^\ell$ working modulo $2,\ 4,$ and $3$, respectively, greatly extending previous results on the subject. We provide a few applications of our characterizations throughout in the form of congruences and a computationally fast recurrence. Moreover, we illustrate a previously undocumented connection between the number of partitions with designated summands and the number of partitions with odd multiplicities. |
| title | Partitions With Designated Summands Not Divisible by $2^l$, $2$, and $3^l$ Modulo $2$, $4$, and $3$ |
| topic | Combinatorics Primary: 11P83, Secondary: 05A17 |
| url | https://arxiv.org/abs/2101.04058 |