相关论文: Right-angled Artin subgroups and free products in …

We prove that the crossed product $C^*$-algebra $C^*_r(\Gamma,\partial\Gamma)$ of a free group $\Gamma$ with its boundary $\partial\Gamma$ naturally sits between the reduced group $C^*$-algebra $C^*_r\Gamma$ and its injective envelope…

We investigate the minimal genus problem for the second homology of a right angled Artin group (RAAG). Firstly, we present a lower bound for the minimal genus of a second homology class, equal to half the rank of the corresponding cap…

Given a strict partial order $\Delta$ on a set $\Lambda$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(\Delta)$ has been studied in depth. We construct a larger family of McLain groups $G(\Delta)$, where…

We show that every right-angled Artin group AG defined by a graph G of finite chromatic number is poly-free with poly-free length bounded between the clique number and the chromatic number of G. Further, a characterization of all…

Let G be a real semisimple Lie group with no compact factors and finite centre, and let $\Lambda$ be a lattice in G. Suppose that there exists a homomorphism from $\Lambda$ to the outer automorphism group of a right-angled Artin group…

Let $\C(\Gamma)$ be the set of isomorphism classes of the finite groups that are homomorphic images of $\Gamma$. We investigate the extent to which $\C(\Gamma)$ determines $\Gamma$ when $\Gamma$ is a group of geometric interest. If…

We construct an embedding of any right-angled Artin group $G(\Delta)$ defined by a graph $\Delta$ into a graph braid group. The number of strands required for the braid group is equal to the chromatic number of $\Delta$. This construction…

This article is dedicated to the study of the acylindrical hyperbolicity of automorphism groups of graph products of groups. Our main result is that, if $\Gamma$ is a finite graph which contains at least two vertices and is not a join and…

In this paper we have discusses {\Gamma}-left, {\Gamma}-right, {\Gamma}-bi-, {\Gamma}-quasi-, {\Gamma}-interior and {\Gamma}-ideals in {\Gamma}-AG^{**}-groupoids and regular {\Gamma}-AG^{**}-groupoids. Moreover we have proved that the set…

Let $\Gamma$ be the random bipartite graph, a countable graph with two infinite sides, edges randomly distributed between the sides, but no edges within a side. In this paper, we investigate the reducts of $\Gamma$ that preserve sides. We…

We show that in any right-angled Artin group whose defining graph has chromatic number $k$, every non-trivial element has stable commutator length at least $1/(6k)$. Secondly, if the defining graph does not contain triangles, then every…

It is well-known that a finitely generated group $\Gamma$ has Kazhdan's property (T) if and only if the Laplacian element $\Delta$ in ${\mathbb R}[\Gamma]$ has a spectral gap. In this paper, we prove that this phenomenon is witnessed in…

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…

We prove a functoriality result for the full C*-algebras of right-LCM monoids with respect to monoid inclusions that are closed under factorization and preserve orthogonality, and use this to show that if a right-LCM monoid is amenable in…

We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…

A discrete group $\Gamma$ is called exact if the reduced group C*-algebra ${C_{\lambda}}^{*}(\Gamma)$ is exact as C*-algebras, and a discrete group $\Lambda$ is called residually exact if every nonunital element $g \in \Lambda$ admits a…

For a graph $\Gamma$ and group $G$, $G^\Gamma$ is the subgroup of $G^{|\Gamma|}$ generated by elements with $g$ in the coordinates corresponding to $v$ and its neighbors in $\Gamma$. There is a natural epimorphism $G^\Gamma \to…

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

We characterize the intra-regular $\Gamma$-semigroups and the left regular $\Gamma$-semigroups $M$ in which $x\Gamma M\subseteq M\Gamma x$ for every $x\in M$ in terms of filters and we prove, among others, that every intra-regular…

Given a countable abelian group $A$, we construct a row finite directed graph $\Gamma(A)$ such that the $K_{0}$-group of the graph $\textrm{C}^{\ast}$-algebra $\textrm{C}^{\ast}(\Gamma(A))$ is canonically isomorphic to $A$. Moreover, each…