Related papers: Rapid Decay is Preserved by Graph Products
We study the rapid decay property and polynomial growth for duals of bicrossed products coming from a matched pair of a discrete group and a compact group
Let Gamma be a discrete group satisfying the rapid decay property with respect to a length function which is conditionally negative. Then the reduced C*-algebra of Gamma has the metric approximation property. The central point of our proof…
We generalize the notion of rapid decay property for a group $G$ to pairs of groups $(G,H)$ where $H$ is a finitely generated subgroup of $G$, where typically the subgroup $H$ does not have rapid decay. We deduce some isomorphisms in…
We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$_1$-factors named $\mathcal{C}_{\rm Rigid}$. For von Neumann algebras in this class we show a unique…
We prove that a finitely generated group $G$ hyperbolic relative to the collection of finitely generated subgroups H_1,..., H_m has the Rapid Decay property if and only if each H_i, i=1,2,..., m, has the Rapid Decay property.
We show that coarse property C is preserved by finite coarse direct products. We also show that the coarse analog of Dydak's countable asymptotic dimension is equivalent to the coarse version of straight finite decomposition complexity and…
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…
Graph products of monoids provide a common framework for direct and free products, and graph monoids (also known as free partially commutative monoids). If the monoids in question are groups, then any graph product is, of course, a group.…
In this note, we extend results about unique $n^{\textrm{th}}$ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified…
We show that the curvature K_(G*H)(x,y) at a point (x,y) in the strong product G*H of two arbitrary finite simple graphs is equal to the product K_G(x) K_H(y) of the curvatures.
We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…
We apply V. Lafforgue's techniques to establish the rapid decay property for cocompact lattices in a finite product of rank one Lie groups with Lie groups whose restricted root system is of type A2.
In the paper Graphical complexity of products of permutation groups, M. Grech, A. Jez, A. Kisielewicz have proved that the direct product of automorphism groups of edge-colored graphs is itself the automorphism groups of an edge-colored…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
We show that groupoid equivalence preserves a number of groupoid properties such as properness or the property of being topologically principal.
In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…
We prove that graph products constructed over infinite graphs with bounded clique number preserve finite asymptotic dimension. We also study the extent to which Dranishnikov's property C, and Dranishnikov and Zarichnyi's straight finite…
We examine asymptotic dimension and property A for groups acting on complexes. In particular, we prove that the fundamental group of a finite, developable complex of groups will have finite asymptotic dimension provided the geometric…
It is an old and challenging topic to investigate for which discrete groups G the full group C*-algebra C*(G) is residually finite-dimensional (RFD). In particular not much is known about how the RFD property behaves under fundamental…