Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.16255

Multisymmetric functions on eventually constant cyclic graphs

Radford Green·Cornell Holmes·Mee Seong Im
View original source ↗Read source document ↗Export metadata ↓

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 $λ$-cyclic $k$-tuples, which we define and provide similar theorems for their generating functions and cardinality.

Explore related subjects

math.COmath.RT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Radford Green, Cornell Holmes, Mee Seong Im. 2026-08-08. Multisymmetric functions on eventually constant cyclic graphs. https://arxiv.org/abs/2604.16255

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs

Lovász (1967) showed that two graphs $G$ and $H$ are isomorphic if, and only if, they are homomorphism indistinguishable over all graphs, i.e., $G$ and $H$ admit the same number of number of homomorphisms from every graph $F$. Subsequently, a substantial line of work studied homomorphism indistinguishability over restricted graph classes. For example, homomorphism indistinguishability over minor-closed graph classes $\mathcal{F}$ such as the class of planar graphs, the class of graphs of treewidth $\leq k$, pathwidth $\leq k$, or treedepth $\leq k$, was shown to be equivalent to quantum isomorphism and equivalences with respect to counting logic fragments, respectively. Via such characterisations, the distinguishing power of e.g. logical or quantum graph isomorphism relaxations can be studied with graph-theoretic means. In this vein, Roberson (2022) conjectured that homomorphism indistinguishability over every graph class excluding some minor is not the same as isomorphism. We prove this conjecture for all vortex-free graph classes. In particular, homomorphism indistinguishability over graphs of bounded Euler genus is not the same as isomorphism. As a negative result, we show that Roberson's conjecture fails when generalised to graph classes excluding a topological minor. Furthermore, we show homomorphism distinguishing closedness for several graph classes including all topological-minor-closed and union-closed classes of forests, and show that homomorphism indistinguishability over graphs of genus $\leq g$ (and other parameters) forms a strict hierarchy.

math.CO↗
arXiv2026

Knowledge management in House of Graphs

The House of Graphs is an online database of graphs which can be accessed at https://houseofgraphs.org/. It serves as a central repository for complete lists of graphs for various graph classes. However, its main feature is a searchable database of so-called "interesting" graphs. The development of the original House of Graphs started in 2010 and it was completely rebuilt in 2021-2022. Each graph in the database is accompanied by a significant amount of meta-data such as a name, drawings, precomputed graph invariants, and comments. Given this amount of information and the importance of reliability in the scientific world, robust data management is essential to ensure accuracy and consistency across the database. In this article, we therefore focus on knowledge management in the House of Graphs and describe the inner workings of the House of Graphs and how we ensure that its data is coherent, qualitative and stable.

math.CO↗
arXiv2026

A Geometric Criterion for Degeneracy in the Elekes-Szabó Theorem

The Elekes-Szabó theorem establishes that an irreducible algebraic hypersurface $Z(F)$ contains few grid points unless it exhibits a specific group-related structure. Identifying this structure from the polynomial $F$ is a challenging problem in combinatorial geometry. Our first main result (Theorem 2.3) provides a local geometric criterion to detect such group-related hypersurfaces. By applying this criterion, we develop a geometric framework for boundary varieties, which are defined by the vanishing of partial derivatives along $Z(F)$. In Theorem 2.4, we show that for group-related varieties, these boundary varieties must be contained in coordinate slices. This gives a strict geometric constraint on the loci where $Z(F)$ becomes tangent to coordinate directions. As an application, we study configurations formed by $d$ coordinate-grid hyperplane families together with a one-parameter polynomial family of hyperspheres in $\mathbb{R}^d$. If one chooses $n$ members from each of these $d+1$ families and obtains $Ω(n^{d-η})$ common incidence points, then the hypersphere family is forced to have a very restricted form: it is concentric in dimensions $d \geq 3$, and in dimension $2$ it is either concentric or consists of fixed-radius circles whose centres lie on a line parallel to a coordinate axis. We also generalize the pinned distance problem initiated by Elekes and Szabó for three points in the plane to $d+1$ points in $\mathbb{R}^d$. More precisely, in Theorem 2.8 we prove that if $d+1$ families of hyperspheres centred at fixed points determine $Ω(n^{d-η})$ points, each lying on one hypersphere from each family, then the centres must be affinely dependent.

math.CO↗