Related papers: Geodesic Growth of Numbered Graph Products
The objective of this paper is to detect which combinatorial properties of a regular graph can completely determine the geodesic growth of the right-angled Coxeter or Artin group this graph defines, and to provide the first examples of…
We give explicit formulas for the geodesic growth series of a Right Angled Coxeter Group (RACG) based on a link-regular graph that is 4-clique free, i.e. without tetrahedrons
In this paper we give an algorithm for computing the conjugacy growth series for a right-angled Artin group, based on a natural language of minimal length conjugacy representatives. In addition, we provide a further language of unique…
In this paper we give a recursive formula for the conjugacy growth series of a graph product in terms of the conjugacy growth and standard growth series of subgraph products. We also show that the conjugacy and standard growth rates in a…
We prove that for any infinite right-angled Coxeter or Artin group, its spherical and geodesic growth rates (with respect to the standard generating set) either take values in the set of Perron numbers, or equal $1$. Also, we compute the…
We give a method for effectively generating generalised loxodromics in subgroups of graph products, using positive words. This has several consequences for the growth of subsets of these groups. In particular, we show that graph products of…
Graph products of cyclic groups and Coxeter groups are two families of groups that are defined by labeled graphs. The family of Dyer groups contains these both families and gives us a framework to study these groups in a unified way. This…
We derive functional relationships between spherical generating functions of graph monoids, right-angled Artin groups and right-angled Coxeter groups. We use these relationships to express the spherical generating function of a right-angled…
We study coherence of graph products and Coxeter groups and obtain many results in this direction.
In this paper we exhibit two infinite families of trees $\{T^1_n\}_{n \geq 17}$ and $\{T^2_n\}_{n \geq 17}$ on $n$ vertices, such that $T^1_n$ and $T^2_n$ are non-isomorphic, co-spectral, and the right-angled Coxeter groups (RACGs) based on…
In this paper we introduce the geodesic conjugacy language and geodesic conjugacy growth series for a finitely generated group. We study the effects of various group constructions on rationality of both the geodesic conjugacy growth series…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
We compute the group homology, the algebraic $K$- and $L$-groups, and the topological $K$-groups of right-angled Artin groups, right-angled Coxeter groups, and more generally, graph products.
The space $\mathcal{G}_n$ of $n$-marked groups provides a natural framework for studying algebraic and geometric invariants under deformation. In general, the growth rate is not continuous on $\mathcal{G}_n$. In this paper, we investigate…
In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…
We determine the factorial growth rate of the number of finite index subgroups of right-angled Artin groups as a function of the index. This turns out to depend solely on the independence number of the defining graph. We also make a…
In this article, we introduce and investigate a class of C$^{\ast}$-algebras generated by reduced graph products of C$^{\ast}$-algebras, augmented with families of projections naturally associated with words in right-angled Coxeter groups.…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
In this paper we consider groups of the form $G\wr L$, where the set of generators naturally extends the sets of generators of $G$ and $L$, and $L$ admits a Cayley graph that is a tree. We show how one can compute the conjugacy growth…
Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality…