Related papers: Sofic groups: graph products and graphs of groups

We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, effectively showing how every hyperlinear approximation to such a group is simulated by a suitable sofic approximation. The…

We develop a theory of graph C*-algebras using path groupoids and inverse semigroups. Row finiteness is not assumed so that the theory applies to graphs for which there are vertices emitting a countably infinite set of edges. We show that…

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 provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

Sofic groups generalise both residually finite and amenable groups, and the concept is central to many important results and conjectures in measured group theory. We introduce a topological notion of a sofic boundary attached to a given…

Given the large class of groups already known to be sofic, there is seemingly a shortfall in results concerning their permanence properties. We address this problem for wreath products, and in particular investigate the behaviour of more…

The $k$-th symmetric product of a graph $G$ with vertex set $V$ with edge set $E$ is a graph with vertices as $k$-sets of $V$, where two $k$-sets are connected by an edge if and only if their symmetric difference is an edge in $E$. Using…

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

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…

Let $G$ be a finite insoluble group with soluble radical $ R(G)$. The solubility graph $\Gamma_{\rm S}(G)$ of $G$ is a simple graph whose vertices are the elements of $G\setminus R(G) $ and two distinct vertices $x$ and $y$ are adjacent if…

We introduce the concept of crossed product of a product system by a locally compact group. We prove that the crossed product of a row-finite and faithful product system by an amenable group is also a row-finite and faithful product system.…

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of…

A graph is well-(edge-)dominated if every minimal (edge) dominating set is minimum. A graph is equimatchable if every maximal matching is maximum. We study these concepts on strong product graphs. We fully characterize well-edge-dominated…

We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…

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…

Let G be a finite group. We show that the rational homotopy groups of symmetric products of the G-equivariant sphere spectrum are naturally isomorphic to the rational homology groups of certain subcomplexes of the subgroup lattice of G.

We introduce the notion of a ``sofic $\mathcal{C}$-action'' of one group on another by automorphisms, for $\mathcal{C}$ a class of groups. We show that if $\mathcal{C}$ is the class of (i) sofic, (ii) hyperlinear, (iii) linear sofic or (iv)…

Topological algebras have properties that extend naturally to those of topological groups [8, 9], but is it the case that semi-direct products exist as in the category of groups? Firstly, we express concepts in categorical language that…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

By defining grids as graphs, geometric graphs can be represented in a very concise way.