Related papers: Formal conjugacy growth in graph products I

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

We study generalisations of conjugacy separability in restricted wreath products of groups. We provide an effective upper bound for $\mathcal{C}$-conjugacy separability of a wreath product $A \wr B$ in terms of the $\mathcal{C}$-conjugacy…

We introduce a new method of proving upper estimates of growth of finitely generated groups and constructing groups of intermediate growth using graphs of their actions. These estimates are of the form $\exp(n^\alpha)$ for some $\alpha<1$,…

Graphs are crucial for representing interrelated data and aiding predictive modeling by capturing complex relationships. Achieving high-quality graph representation is important for identifying linked patterns, leading to improvements in…

The joint spectral radius of a compact set of d-times-d matrices is defined ?to be the maximum possible exponential growth rate of products of matrices drawn from that set. In this article we investigate the ergodic-theoretic structure of…

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.

We propose a hierarchical normalizing flow model for generating molecular graphs. The model produces new molecular structures from a single-node graph by recursively splitting every node into two. All operations are invertible and can be…

Stochasticity is introduced to a well studied class of recursively grown graphs: $(u,v)$-flower nets, which have power-law degree distributions as well as small-world properties (when $u=1$). The stochastic variant interpolates between…

A $k$-matching $M$ of a graph $G=(V,E)$ is a subset $M\subseteq E$ such that each connected component in the subgraph $F = (V,M)$ of $G$ is either a single-vertex graph or $k$-regular, i.e., each vertex has degree $k$. In this contribution,…

We provide sufficient conditions for a regular graph $G$ of growing degree $d$, guaranteeing a phase transition in its random subgraph $G_p$ similar to that of $G(n,p)$ when $p\cdot d\approx 1$. These conditions capture several well-studied…

We apply the method of iterated inflations to show that the wreath product of a cellular algebra with a symmetric group is cellular, and obtain descriptions of the cell and simple modules together with a semisimplicity condition for such…

The spectrum of Laplacian and signless Laplacian matrix for a graph product is obtained, where both underlying graphs are regular. As an application of this, we have been able to generate the Kirchhoff Index and Wiener Index and determine…

We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…

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…

Given a finitely generated relatively hyperbolic group $G$, we construct a finite generating set $X$ of $G$ such that $(G,X)$ has the `falsification by fellow traveler property' provided that the parabolic subgroups $\{H_\omega\}_{\omega\in…

We derive a recurrence relation for the number of simple vertex-labelled bipartite graphs with given degrees of the vertices and use this result to obtain a new method for computing the growth function of the Artin monoid of type $A_{n-1}$…

We give a sufficient condition for a sequence of normal subgroups of a free group to have the property that both, their growths tend to the upper bound and their cogrowths tend to the lower bound. The condition is represented by planarity…

In this paper, we primarily investigate the following symmetric presentation of the surface group $\pi_1(\Sigma_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle$. For every nontrivial element…

This paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers, and are confined to the…