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

It is well-known that the existence of more than two ends in the sense of J.R. Stallings for a finitely generated discrete group $G$ can be detected on the cohomology group $\mathrm{H}^1(G,R[G])$, where $R$ is either a finite field, the…

We show that every finitely generated cohomologically trivial module over $RG$, where $G$ is a finite $p$-group and $R$ is a $p$-adic ring, splits as the direct sum of a finite cohomologically trivial $RG$-module and a free $RG$-module.…

In this paper we introduce the concept of a Cayley graph automatic group (CGA group or graph automatic group, for short) which generalizes the standard notion of an automatic group. Like the usual automatic groups graph automatic ones enjoy…

Let $\Gamma$ be a finite graph, and for each vertex $i$ let $G_i$ be a finitely presented group. Let $G$ be the graph product of the $G_i$. That is, $G$ is the group obtained from the free product of the $G_i$ by factoring out by the…

We show that graph products of finite abelian groups are elementarily equivalent if and only if they are $\exists\forall$-equivalent if and only if they are isomorphic. In particular, two right-angled Coxeter groups are elementarily…

Geometric semigroup theory is the systematic investigation of finitely-generated semigroups using the topology and geometry of their associated automata. In this article we show how a number of easily-defined expansions on finite semigroups…

We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…

We study the automorphisms of graph products of cyclic groups, a class of groups that includes all right-angled Coxeter and right-angled Artin groups. We show that the group of automorphism generated by partial conjugations is itself a…

If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability…

The Rado Graph, sometimes also known as the (countable) Random Graph, can be generated almost surely by putting an edge between any pair of vertices with some fixed probability $p \in (0, 1)$, independently of other pairs. In this article,…

We give a geometric characterization of finite rational groups. In particular, we prove that a finite group is rational if and only if there exists a finite geometry $\Gamma$ of type $I$ and action of $G$ on $\Gamma$ as a group of…

We consider the outer automorphism group Out(A_Gamma) of the right-angled Artin group A_Gamma of a random graph Gamma on n vertices in the Erdos--Renyi model. We show that the functions (log(n)+log(log(n)))/n and 1-(log(n)+log(log(n)))/n…

We introduce and study, for a process P delivering edges on the Cartesian product of the vertex sets of a given set of graphs, the P-product of these graphs, thereby generalizing many types of product graph. Analogous to the notion of a…

If G is a semidirect product N by H with N normal and finitely generated then G has the property that every finite group is a quotient of some finite index subgroup of G if and only if one of N and H has this property. This has applications…

We show that if $H$ is an almost normal subgroup of $G$ such that both $H$ and $G$ are of type $VFP$ and vcd($G$) = vcd($H$) + 1, then $G$ is the fundamental group of a graph of groups in which all vertex and edge groups are commensurable…

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.

For each group G which decomposes into a finitary direct product of free groups of finite rank we construct a regular band B such that the free idempotent generated semigroup over B contains a maximal subgroup isomorphic to G. In…

Assume that $G$ is a finite group and let $a$ and $b$ be non-negative integers. We define an undirected graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and…

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…