Colored Partitions and Minimal Excludants
math.CO, math.NT
Submitted: 2026-10-25
Updated: 2026-10-25
Comments: 22 pages
License: http://creativecommons.org/licenses/by/4.0/
The gist: In this article, we introduce the concept of minimal excludants in colored partitions and extend it to the framework of least r-gaps.
Abstract
In this article, we introduce the concept of minimal excludants in colored partitions and extend it to the framework of least r-gaps. In particular, we focus on k-colored partitions and cubic partitions, deriving the generating functions for the sums of minimal excludants and least r-gaps, and analyzing their asymptotic behaviors. Notably, the presented theory is comprehensively extended by the systematic generalization of each result for minimal excludants in k-colored partitions to the case of least r-gaps. We introduce generalized cubic partitions and discover the minimal excludant, as well as several additional results.
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality