Indexed metadata

Colored Partitions and Minimal Excludants

Suverchla Arora, Meenakshi Rana, Shruti Sharma, Nilanjan Bag

Source record

Source: arXiv

Published: Oct 25, 2026

arXiv: 2610.34155

Open original source ↗

Source abstract

In this article, we introduce the concept of minimal excludants in colored partitions and extend it to the framework of least rr-gaps. In particular, we focus on kk-colored partitions and cubic partitions, deriving the generating functions for the sums of minimal excludants and least rr-gaps, and analyzing their asymptotic behaviors. Notably, the presented theory is comprehensively extended by the systematic generalization of each result for minimal excludants in kk-colored partitions to the case of least rr-gaps. We introduce generalized cubic partitions and discover the minimal excludant, as well as several additional results.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.