Pankaj Jyoti Mahanta
Research Subjects
Pankaj Jyoti Mahanta has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Manjil P. Saikia
Mathematical and Physical Sciences Division, School of Arts and Sciences, Ahmedabad University, Ahmedabad, India
6 shared publications - Daniel Yaqubi
Department of Pure Mathematics Ferdowsi University of Mashhad P. O. Box 1159 91775 Mashhad Iran
2 shared publications - Koustav Banerjee
Johannes Kepler University
1 shared publication - Manosij Ghosh Dastidar
Technische Universität Wien, Wien, Austria
1 shared publication - Sreerupa Bhattacharjee1 shared publication
Latest Publications
- Open Access
Extensions of some results of Jovovic and Dhar
We look at extensions of formulas given by Jovovic and recently proved by Dhar on integer partitions where the smallest part occurs at least $m$ times and on integer partitions with fixed differences between the largest and smallest parts where the smallest part occurs at least $k$ times. Our results extend Dhar's results for the $m=2$ and $k=1$ cases to the general cases for arbitrary $m$ and $k$. We also look at analogous results for overpartitions and $\ell$-regular partitions.Open AccessExtensions of some results of Jovovic and Dhar
We look at extensions of formulas given by Jovovic and recently proved by Dhar on integer partitions where the smallest part occurs at least $m$ times and on integer partitions with fixed differences between the largest and smallest parts where the smallest part occurs at least $k$ times. Our results extend Dhar's results for the $m=2$ and $k=1$ cases to the general cases for arbitrary $m$ and $k$. We also look at analogous results for overpartitions and $\ell$-regular partitions. - Open AccessOn the number of partitions of $n$ whose product of the summands is at most $n$We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.Open AccessOn the number of partitions of $n$ whose product of the summands is at most $n$We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.
- Open Access
Parity biases in partitions and restricted partitions
Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ and conjectured that $d_{o}(n)>d_{e}(n)$ for all $n>19$ where $d_{o}(n)$ (resp. $d_{e}(n)$) denote the number of partitions into distinct parts having more odd parts (resp. even parts) than even parts (resp. odd parts). In this paper we provide combinatorial proofs for both the result and the conjecture of Kim, Kim and Lovejoy. In addition, we show that if we restrict the smallest part of the partition to be $2$, then the parity bias is reversed. That is, if $q_{o}(n)$ (resp. $q_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts) where the smallest part is at least $2$, then we have $q_o(n)7$. We also look at some more parity biases in partitions with restricted parts.Open AccessParity biases in partitions and restricted partitions
Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts). Recently, Kim, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ and conjectured that $d_{o}(n)>d_{e}(n)$ for all $n>19$ where $d_{o}(n)$ (resp. $d_{e}(n)$) denote the number of partitions into distinct parts having more odd parts (resp. even parts) than even parts (resp. odd parts). In this paper we provide combinatorial proofs for both the result and the conjecture of Kim, Kim and Lovejoy. In addition, we show that if we restrict the smallest part of the partition to be $2$, then the parity bias is reversed. That is, if $q_{o}(n)$ (resp. $q_{e}(n)$) denote the number of partitions of $n$ with more odd parts (resp. even parts) than even parts (resp. odd parts) where the smallest part is at least $2$, then we have $q_o(n)7$. We also look at some more parity biases in partitions with restricted parts. - 1 December 2020
- Published by Elsevier in Journal of Number Theory
- Vol. 217, 218-236
Some properties of Zumkeller numbers and k-layered numbers
- 1 December 2020
- Published by Elsevier in Journal of Number Theory
- Vol. 217, 218-236
Some properties of Zumkeller numbers and k-layered numbers
- Open Access
Some properties of Zumkeller numbers and $k$-layered numbers
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same sum, which will be $\sigma(n)/2$. Generalizing even further, we call $n$ a $k$-layered number if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we completely characterize Zumkeller numbers with two distinct prime factors and give some bounds for prime factorization in case of Zumkeller numbers with more than two distinct prime factors. We also characterize $k$-layered numbers with two distinct prime factors and even $k$-layered numbers with more than two distinct odd prime factors. Some other results concerning these numbers and their relationship with practical numbers and Harmonic mean numbers are also discussed.Open AccessSome properties of Zumkeller numbers and $k$-layered numbers
Generalizing the concept of a perfect number is a Zumkeller or integer perfect number that was introduced by Zumkeller in 2003. The positive integer $n$ is a Zumkeller number if its divisors can be partitioned into two sets with the same sum, which will be $\sigma(n)/2$. Generalizing even further, we call $n$ a $k$-layered number if its divisors can be partitioned into $k$ sets with equal sum. In this paper, we completely characterize Zumkeller numbers with two distinct prime factors and give some bounds for prime factorization in case of Zumkeller numbers with more than two distinct prime factors. We also characterize $k$-layered numbers with two distinct prime factors and even $k$-layered numbers with more than two distinct odd prime factors. Some other results concerning these numbers and their relationship with practical numbers and Harmonic mean numbers are also discussed. - Open Access
Some New and Old Gibonacci Identities
We present a different combinatorial interpretations of Lucas and Gibonacci numbers. Using these interpretations we prove several new identities, and simplify the proofs of several known identities. Some open problems are discussed towards the end of the paper.
Open AccessSome New and Old Gibonacci Identities
We present a different combinatorial interpretations of Lucas and Gibonacci numbers. Using these interpretations we prove several new identities, and simplify the proofs of several known identities. Some open problems are discussed towards the end of the paper.
- Open Access
A family of lacunary recurrences for Lucas Numbers
We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.
Open AccessA family of lacunary recurrences for Lucas Numbers
We prove an infinite family of lacunary recurrences for the Lucas numbers using combinatorial means.