2 citations · 2 across the 16 of their papers we have counts for
5 papers · 1 filter
On Glaisher's Partition Theorem
George E. Andrews, Aritram Dhar
Glaisher's theorem states that the number of partitions of into parts which repeat at most times is equal to the number of partitions of into parts which are not divi…
Finite analogs of partition bias related to hook length two and a variant of Sylvester's map
Alexander Berkovich, Aritram Dhar
In this paper, we count the total number of hooks of length two in all odd partitions of and all distinct partitions of with a bound on the largest part of the partitions.…
New Borwein-type conjectures
Alexander Berkovich, Aritram Dhar
Motivated by recent research of Wang and Krattenthaler, we use Maple to propose five new ``Borwein-type'' conjectures modulo and two new ``Borwein-type'' conjectures modulo …
Extension of Bressoud's generalization of Borwein's conjecture and some exact results
Alexander Berkovich, Aritram Dhar
In this paper, we conjecture an extension to Bressoud's 1996 generalization of Borwein's famous 1990 conjecture. We then state a few infinite hierarchies of non-negative -series…
A bijective proof of an identity of Berkovich and Uncu
Aritram Dhar, Avi Mukhopadhyay
The BG-rank BG() of an integer partition is defined as where is the number of odd-indexed odd parts and is the number of even-indexed odd par…