Related papers: Random graph products of finite groups are rationa…

We characterize which groups splitting as finite graphs of free groups with cyclic edge groups are residually finite. Such a group $G$ is residually finite if and only if all its Baumslag-Solitar subgroups are residually finite. From a…

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

A finite group $G$ is said to be rational if every character of $G$ is rational-valued. The Gruenberg-Kegel graph of a finite group $G$ is the undirected graph whose vertices are the primes dividing the order of $G$ and the edges join…

We define a semidirect product groupoid of a system of partially defined local homeomorphisms $T=(T_{1},..., T_{r})$. We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use…

In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $\Gamma$ is a finite graph which is the…

We study analytic properties of graph product of finite groups with a hyperbolic defining graph. This is done by studying dynamics on the Bowditch compactification of the extension graph, or the crossing graph, of graph product. In…

We classify finite groups $G$, such that the group algebra, $\mathbb{Q}G$ (over the field of rational numbers $\mathbb{Q}$), is the direct product of the group algebra $\mathbb{Q}[G/N]$ of a proper factor group $G/N$, and some division…

A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…

The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.

The random ordered graph is the up to isomorphism unique countable homogeneous linearly ordered graph that embeds all finite linearly ordered graphs. We determine the reducts of the random ordered graph up to first-order interdefinability.

A {\it graph product} $G$ on a graph $\Gamma$ is a group defined as follows: For each vertex $v$ of $\Gamma$ there is a corresponding non-trivial group $G_v$. The group $G$ is the quotient of the free product of the $G_v$ by the commutation…

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…

Much is known about random right-angled Coxeter groups (i.e., right-angled Coxeter groups whose defining graphs are random graphs under the Erd\"os-R\'enyi model). In this paper, we extend this model to study random general Coxeter groups…

We define graph products of families of pairs of groups and study the question when two such graph products are commensurable. As an application we prove linearity of certain graph products.

Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

We present here random distributions on $(D+1)$-edge-colored, bipartite graphs with a fixed number of vertices $2p$. These graphs are dual to $D$-dimensional orientable colored complexes. We investigate the behavior of quantities related to…

We study the behaviour of random labelled and unlabelled cographs with n vertices as n tends to infinity. Our main result is a novel probabilistic limit in the space of graphons.

Every finitely generated self-similar group naturally produces an infinite sequence of finite $d$-regular graphs $\Gamma_n$. We construct self-similar groups, whose graphs $\Gamma_n$ can be represented as an iterated zig-zag product and…

We determine all the ways in which a direct product of two finite groups can be expressed as the set-theoretical union of proper subgroups in a family of minimal cardinality.