Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.23668

Multivariate growth series of graph products of groups

Chaithra Pilakkat·Venkatesh Rajendran
View original source ↗Read source document ↗Export metadata ↓

Abstract

Right-angled Artin groups (RAAGs) and right-angled Coxeter groups (RACGs) associated with finite simple graphs are fundamental objects in geometric group theory. Their one-variable growth series with respect to the standard generating sets was classically expressed by Chiswell in terms of the one-variable independence polynomial of the defining graph [2] with suitable substitutions of the variable. In this paper, we investigate the multivariate growth series of graph products of groups and derive explicit formulas in terms of the multivariate independence polynomial of the underlying graph through suitable substitutions of variables. As special cases, we obtain multivariate growth series formulas for RAAGs and RACGs, thereby extending the classical one-variable identities. We further show that the coefficients of the multivariate growth series of RAAGs and RACGs admit explicit descriptions in terms of the double-marked and marked chromatic polynomials of graphs. This connection reveals a rich interplay between growth series and graph coloring invariants. In particular, we obtain completely explicit formulas for all the coefficients in the case of chordal graphs, which include, for example, trees and complete graphs.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chaithra Pilakkat, Venkatesh Rajendran. 2026-07-26. Multivariate growth series of graph products of groups. https://arxiv.org/abs/2607.23668

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗