PEPramod Eyyunni

Pramod Eyyunni

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Pramod Eyyunni has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A divisor generating q-series and cumulants arising from random graphs

    by Archit Agarwal, Subhash Chand Bhoria, Pramod Eyyunni, Bibekananda Maji, Tanay Wakhare

  • Open Access

    A divisor generating q-series identity and its applications to probability theory and random graphs

    by Archit Agarwal, Subhash Chand Bhoria, Pramod Eyyunni, Bibekananda Maji

    In I981, Uchimura studied a divisor generating $q$-series that has applications in probability theory and in the analysis of data structures, called heaps. Mainly, he proved the following identity. For $|q|<1$, \begin{equation*} \sum_{n=1}^\infty n q^n (q^{n+1})_\infty =\sum_{n=1}^{\infty} \frac{(-1)^{n-1} q^{\frac{n(n+1)}{2} } }{(1-q^n) ( q)_n } = \sum_{n=1}^{\infty} \frac{ q^n }{1-q^n}. \end{equation*} Over the years, this identity has been generalized by many mathematicians in different directions. Uchimura himself in 1987, Dilcher (1995), Andrews-Crippa-Simon (1997), and recently Gupta-Kumar (2021) found a generalization of the aforementioned identity. Any generalization of the right most expression of the above identity, we name as divisor-type sum, whereas a generalization of the middle expression we say Ramanujan-type sum, and any generalization of the left most expression we refer it as Uchimura-type sum. Quite surprisingly, Simon, Crippa and Collenberg (1993) showed that the same divisor generating function has a connection with random acyclic digraphs. One of the main themes of this paper is to study these different generalizations and present a unified theory. We also discuss applications of these generalized identities in probability theory for the analysis of heaps and random acyclic digraphs.

  • Open Access

    On the combinatorics of r-chain minimal and maximal excludants

    by Subhash Chand Bhoria, Pramod Eyyunni, Runqiao Li

    The minimal excludant (mex) of a partition was introduced by Grabner and Knopfmacher under the name `least gap' and was revived by a couple of papers due to Andrews and Newman. It has been widely studied in recent years together with the complementary partition statistic maximal excludant (maex), first introduced by Chern. Among such recent works, the first and second authors along with Maji introduced and studied the $r$-chain minimal excludants (r-chain mex) which led to a new generalization of Euler's classical partition theorem and the sum-of-mex identity of Andrews and Newman. In this paper, we first give combinatorial proofs for these two results on r-chain mex. Then we introduce the r-chain maximal excludants (r-chain maex) and establish the associated identity for the sum of r-chain maex over all partitions, both analytically and combinatorially.