Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Erin Y. Y. Shen"'
Autor:
Robert X. J. Hao, Erin Y. Y. Shen
Publikováno v:
The Ramanujan Journal. 57:785-802
Andrews, Lewis, and Lovejoy introduced the partition function PD(n) as the number of partitions of n with designated summands. A bipartition of n is an ordered pair of partitions $$(\pi _1, \pi _2)$$ with the sum of all of the parts being n. In this
Autor:
Robert X. J. Hao, Erin Y. Y. Shen
Publikováno v:
International Journal of Number Theory. 17:2153-2173
An [Formula: see text]-regular overpartition of [Formula: see text] is an overpartition of [Formula: see text] into parts not divisible by [Formula: see text]. Let [Formula: see text] be the number of [Formula: see text]-regular overpartitions of [Fo
Publikováno v:
Discrete Mathematics. 344:112556
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over all the part
Autor:
Erin Y. Y. Shen
Publikováno v:
International Journal of Number Theory. 13:717-724
In a recent work, Andrews introduced the new combinatorial objects called singular overpartitions. He proved that these singular overpartitions can be enumerated by the partition function [Formula: see text] which denotes the number of overpartitions
Autor:
Erin Y. Y. Shen
Publikováno v:
International Journal of Number Theory. 12:841-852
Recently, Andrews introduced the partition function [Formula: see text] as the number of overpartitions of [Formula: see text] in which no part is divisible by [Formula: see text] and only parts [Formula: see text] may be overlined. He proved that [F
Publikováno v:
Journal of Number Theory. 133:2929-2938
Andrews, Lewis and Lovejoy introduced the partition function PD ( n ) as the number of partitions of n with designated summands, where we assume that among parts with equal size, exactly one is designated. They proved that PD ( 3 n + 2 ) is divisible