Related papers: Rapid Decay is Preserved by Graph Products

A group $G$ is called automatically continuous if any homomorphism from a completely metrizable or locally compact Hausdorff group to $G$ has open kernel. In this paper, we study preservation of automatic continuity under group-theoretic…

A finitely generated group $G$ is said to be condensed if its isomorphism class in the space of finitely generated marked groups has no isolated points. We prove that every product variety $\mathcal{UV}$, where $\mathcal{U}$ (respectively,…

This article presents a machinery based on polyhedral products that produces faithful representations of graph products of finite groups and direct products of finite groups into automorphisms of free groups $\rm Aut(F_n)$ and outer…

We prove a sharp representation stability result for graph complexes with a distinguished vertex, and prove that the chains realizing this sharp bound pass to non-trivial families of graph homology classes. This result may be interpreted as…

A result by Bridson, Howie, Miller, and Short states that if $S$ is a finitely presented subgroup of the direct product of free groups, then $S$ is virtually a nilpotent extension of a direct product of free groups. Moreover, if $S$ is a…

For a locally compact group, property RD gives a control on the convolution norm of any compactly supported measure in terms of the $L^2$-norm of its density and the diameter of its support. We give a complete classification of those Lie…

Root-class residuality of free product of root-class residual groups is demonstrated. A sufficient condition for root-class residuality of generalized free product $G$ of groups $A$ and $B$ amalgamating subgroups $H$ and $K$ through the…

We give an explicit characterization of which direct products $G$ of surface groups of Euclidean type satisfy that the fixed subgroup of any automorphism (or endomorphism) of $G$ is compressed, and of which is it always inert.

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…

We prove the exponential growth of product replacement graphs for a large class of groups. Much of our effort is dedicated to the study of product replacement graphs of Grigorchuk groups, where the problem is most difficult.

The study of graph products is a major research topic and typically concerns the term $f(G*H)$, e.g., to show that $f(G*H)=f(G)f(H)$. In this paper, we study graph products in a non-standard form $f(R[G*H]$ where $R$ is a "reduction", a…

We prove that the property of being cyclic subgroup separable, that is having all cyclic subgroups closed in the profinite topology, is preserved under forming graph products. Furthermore, we develop the tools to study the analogous…

A metric space (X,d) is declared to be natural if (X,d) determines an up to isomorphism unique group structure (X,+) on the set X such that all the group translations and group inversion are isometries. A group is called natural if it…

In this paper, we provide few results on the group distance magic labeling of lexicographic product and direct product of two graphs. We also prove some necessary conditions for a graph to be group distance magic and provide a…

As the first step towards developing noncommutative geometry over Hecke C*-algebras, we study property (RD) (Rapid Decay) for Hecke pairs. When the subgroup H in a Hecke pair (G,H) is finite, we show that the Hecke pair (G,H) has (RD) if…

Let M be a compact manifold, possibly with boundary. We show that the group of homeomorphisms of M has the automatic continuity property: any homomorphism from Homeo(M) to any separable group is necessarily continuous. This answers a…

A graph is called $d$-rigid if there exists a generic embedding of its vertex set into $\mathbb{R}^d$ such that every continuous motion of the vertices that preserves the lengths of all edges actually preserves the distances between all…

We establish for the first time the explicit curvature formulas for the horizontal and vertical edges of the strong product of two regular graphs. We complement this result with showing that there does not exist an analogous formula for the…

The Product Replacement Algorithm is a practical algorithm for generating random elements of a finite group. The algorithm can be described as a random walk on a graph whose vertices are the generating k-tuples of the group (for a fixed…

Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with…