Multisymmetric functions on eventually constant cyclic graphs

TL;DR

This paper explores multisymmetric functions related to eventually constant cyclic graphs, providing formulas for counting and characterizing these structures and extending to more general cyclic configurations.

Contribution

It generalizes the relationship between rooted trees and endomorphisms to multisymmetric functions on cyclic graphs, offering explicit formulas and representation-theoretic insights.

Findings

Derived weighted counts of eventually constant k-tuples

Constructed explicit formulas for generating polynomials

Analyzed the cardinality of the set of such k-tuples

Abstract

The study of spanning trees and related structures is central in graph theory, closely connected to understanding functions between finite sets. This paper generalizes the established relationship between rooted trees and eventually constant endomorphisms to a wider context including $k$-tuples of functions among $k$ disjoint vertex sets. We derive a weighted count of eventually constant $k$-tuples, which are characterized by their stabilization to constancy upon iterated composition. This construction is the set-theoretic analogue of the nilpotent cone and offers new insight into the combinatorial structure of cyclic digraphs. By identifying these $k$-tuples with their induced digraphs, we construct explicit formulas for their generating polynomials and analyze the cardinality of the set of eventually constant $k$-tuples. These polynomials are multisymmetric in $k$ sets of variables and can be re-expressed as the character of a representation of the product of general linear groups. We extend the ideas to the more general structures of eventually $N$-cyclic and $\lambda$-cyclic $k$-tuples, which we define and provide similar theorems for their generating functions and cardinality.