2 citations · 2 across the 16 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
math.CO2025
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…
math.NT2025
Further Applications of Cubic -Binomial Transformations
Alexander Berkovich, Aritram Dhar
Consider \begin{align*} G(N,M;α,β,K,q) = \sum\limits_{j\in\mathbb{Z}}(-1)^jq^{\frac{1}{2}Kj((α+β)j+α-β)}\left[\begin{matrix}M+N\\N-Kj\end{matrix}\right]_{q}. \end{align*} In this p…
math.CO2025
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.…