Related papers: Cartesian subgroups in graph products of groups

A practical approach is proposed to construct short presentations for Euclidean crystallographic groups in terms of generators and relations. For our purposes a short presentation is the one with a small number of short relators for a given…

We show that the outer automorphism groups of graph products of finitely generated abelian groups satisfy the Tits alternative, are residually finite, their so-called Torelli subgroups are finitely generated, and they satisfy a dichotomy…

A graph is Cartesian decomposable if it is isomorphic to a Cartesian product of (more than one) strictly smaller graphs, each of which has more than one vertex and admits no such decomposition. These smaller graphs are called the…

The k-fold Cartesian product of a graph G is defined as a graph on k-tuples of vertices, where two tuples are connected if they form an edge in one of the positions and are equal in the rest. Starting with G as a single edge gives G^k as a…

We introduce the free inhomogeneous wreath product of compact matrix quantum groups, which generalizes the free wreath product (Bichon 2004). We use this to present a general technique to determine quantum automorphism groups of connected…

We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…

We study Coxeter groups from which there is a natural map onto a symmetric group. Such groups have natural quotient groups related to presentations of the symmetric group on an arbitrary set $T$ of transpositions. These quotients, denoted…

Let G be a group definable in an o-minimal structure M. We prove that the union of the Cartan subgroups of G is a dense subset of G. When M is an expansion of a real closed field we give a characterization of Cartan subgroups of G via their…

This paper is concerned with the recognition of approximate graph products with respect to the Cartesian product. Most graphs are prime, although they can have a rich product-like structure. The proposed algorithms are based on a local…

Given a finite graph G there is a corresponding group given by the presentation with generators the vertices of G and a relation [x,y]=1 for generators x and y precisely when (x,y) is an edge of G. Such groups are known as partially…

We present a contribution to the structure theory of locally compact groups. The emphasis is on compactly generated locally compact groups which admit no infinite discrete quotient. It is shown that such a group possesses a characteristic…

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…

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

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…

This paper is concerned with the fast computation of a relation $\R$ on the edge set of connected graphs that plays a decisive role in the recognition of approximate Cartesian products, the weak reconstruction of Cartesian products, and the…

In this paper we define a new product-like binary operation on directed graphs, and we discuss some of its properties. We also briefly discuss its application in constructing the subtyping relation in generic nominally-typed object-oriented…

We study the automorphisms of a graph product of finitely-generated abelian groups W. More precisely, we study a natural subgroup Aut* W of Aut W, with Aut* W = Aut W whenever vertex groups are finite and in a number of other cases. We…

Inspired by the definition of generalized wreath product of permutation groups, we define the generalized wreath product of graphs, containing the classical Cartesian and wreath product of graphs as particular cases. We prove that the…

The fundamental group of a finite graph of groups with trivial edge groups is a free product. We are interested in those outer automorphisms of such a free product that permute the conjugacy classes of the vertex groups. We show that in…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…