activity
20182026
most citedA refinement of a result of Andrews and Newman on the sum of minimal excludants

7 citations · 11 across the 14 of their papers we have counts for

collaborators
Showing math.COShow all

5 papers · 1 filter

math.CO2026

Elementary symmetric polynomials and a potentially injective family of maps on partitions

Aman Devnani, Pramod Eyyunni

In this article, we provide an infinite family of examples to disprove a recent conjecture due to Ballantine and her collaborators on the injectivity of a class of maps, namely pre…

math.CO2026

On the number of missing integers in partitions

Subhash Chand Bhoria, Pramod Eyyunni, Subhrangsu Santra

In the preceding decade, Andrews and Newman resurrected the concept of a `minimal excludant' of a partition (, for short), namely, the least positive missing integer in a part…

math.CO2023

On the combinatorics of r-chain minimal and maximal excludants

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…

math.CO2022

Bressoud-Subbarao type weighted partition identities for a generalized divisor function

Archit Agarwal, Subhash Chand Bhoria, Pramod Eyyunni +1

In 1984, Bressoud and Subbarao obtained an interesting weighted partition identity for a generalized divisor function, by means of combinatorial arguments. Recently, the last three…

math.CO2022

A new generalization of the minimal excludant arising from an analogue of Franklin's identity

Subhash Chand Bhoria, Pramod Eyyunni, Bibekananda Maji

Euler's classical identity states that the number of partitions of an integer into odd parts and distinct parts are equinumerous. Franklin gave a generalization by considering part…