Related papers: Rapid Decay is Preserved by Graph Products

The power graph $P(G)$ of a finite group $G$ is the graph with vertex set $G$ and two distinct vertices are adjacent if either of them is a power of the other. Here we show that the power graph $P(G_1 \times G_2)$ of the direct product of…

Tanigawa (2016) showed that vertex-redundant rigidity of a graph implies its global rigidity in arbitrary dimension. We extend this result to periodic graphs under fixed lattice representations. A periodic graph is vertex-redundantly rigid…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

A result of Bridson, Howie, Miller and Short states that if $S$ is a subgroup of type $FP_{n}(\mathbb{Q})$ of the direct product of $n$ limit groups over free groups, then $S$ is virtually the direct product of limit groups over free…

We prove that the Connes embedding problem is stable under graph products.

For a simple graph $\Gamma$ and for unital $C^*$-algebras with GNS-faithful states $(\mathbf{A}_v,\varphi_v)$ for $v\in V\Gamma$, we consider the reduced graph product $(\mathcal{A},\varphi)=*_{v,\Gamma}(\mathbf{A}_{v},\varphi_v)$ , and…

Let $X$ be a connected Cayley graph on an abelian group of odd order, such that no two distinct vertices of $X$ have exactly the same neighbours. We show that the direct product $X \times K_2$ (also called the "canonical double cover" of…

By means of analyzing the notion of verbal products of groups, we show that soficity, hyperlinearity, amenability, the Haagerup property, the Kazhdan's property (T) and exactness are preserved under taking $k$-nilpotent products of groups,…

We show that the group of presentation $< a,b,c,s,t\mid c=ab=ba,\, c^2=sas^{-1}=tbt^{-1}>$ (introduced by D. Wise) has the property of rapid decay.

Residual finiteness is known to be an important property of groups appearing in combinatorial group theory and low dimensional topology. In a recent work [2] residual finiteness of quandles was introduced, and it was proved that free…

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…

We investigate connections between various rigidity and softness properties for discrete quantum groups. After introducing a notion of residual finiteness, we show that it implies the Kirchberg factorization property for the discrete…

A finitely generated group $\G$ equipped with a word-length is said to satisfy property RD if there are $C, s\geq 0$ such that, for all non-negative integers $n$, we have $\|a\|\leq C (1+n)^s \|a\|_2$ whenever $a\in\C\G$ is supported on…

The group property FW stands in-between the celebrated Kazdhan's property (T) and Serre's property FA. Among many characterizations, it might be defined, for finitely generated groups, as having all Schreier graphs one-ended. It follows…

In this article we prove some previously announced results about metric ultraproducts of finite simple groups. We show that any non-discrete metric ultraproduct of alternating or special linear groups is a geodesic metric space. For more…

We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…

We show that, under fairly general conditions, many elements of a p-adic group can be well approximated by a product whose factors have properties that are helpful in performing explicit character computations.

If $G$ is a graph then a subgraph $H$ is $isometric$ if, for every pair of vertices $u,v$ of $H$, we have $d_H(u,v) = d_G(u,v)$ where $d$ is the distance function. We say a graph $G$ is $distance\ preserving\ (dp)$ if it has an isometric…