On k-color mex-related partition functions
Abstract
In this paper, we investigate a set of k-color partitions and examine how its subsets relates to the theory of the minimal excludant function introduced by Andrews and Newman. Furthermore, we provide generalization of the partition functions introduced by Andrews and Bachraoui and also define several new partition functions within this framework.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.