Preprint
Sep 2026
Analytic Combinatorics of $d$-Set Mappings and Their Applications
A $d$-set mapping is a function acting on a domain $X$ equipped with a partition into $d$ disjoint subsets. While standard functions represent $1$-set mappings, generalizations to arbitrary $d$-partite structures appear naturally across discrete mathematics. In this paper, we develop an analytic combinatorial framework...
Toma Diaconescu-Grabari, D. Panario
· 0 citations