Related papers: Graph products and measure equivalence: classifica…
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…
Motivated by Popa's seminal work \cite{Po04}, in this paper, we provide a fairly large class of examples of group actions $\Gamma \curvearrowright X$ satisfying the extended Neshveyev-St{\o}rmer rigidity phenomenon \cite{NS03}: whenever…
We develop a battery of tools for studying quasi-isometric rigidity and classification problems for splittings of groups. The techniques work best for finite graphs of groups where all edge and vertex groups are coarse PD groups. For…
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,…
Bader, Furman and Sauer have introduced the notion of integrable measure equivalence for finitely-generated groups. This is the sub-equivalence relation of measure equivalence obtained by insisting that the relevant cocycles satisfy an…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
We provide a new large class of countable icc groups $\mathcal A$ for which the product rigidity result from [CdSS15] holds: if $\Gamma_1,\dots,\Gamma_n\in\mathcal A$ and $\Lambda$ is any group such that…
We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…
We study the analogue in orbit equivalence of free product decomposition and free indecomposability for countable groups. We introduce the (orbit equivalence invariant) notion of freely indecomposable ({\FI}) standard probability measure…
Graph product is a fundamental tool with rich applications in both graph theory and theoretical computer science. It is usually studied in the form $f(G*H)$ where $G$ and $H$ are graphs, * is a graph product and $f$ is a graph property. For…
In this paper we develop a rigorous foundation for the study of integration and measures on the space $\mathscr{G}(V)$ of all graphs defined on a countable labelled vertex set $V$. We first study several interrelated $\sigma$-algebras and a…
We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…
The present paper constructs unbounded quasimorphisms that are invariant under all automorphisms on free products of more than two factors and on graph products of finitely generated abelian groups. This includes many classes of right…
Quantifying the similarity between two graphs is a fundamental algorithmic problem at the heart of many data analysis tasks for graph-based data. In this paper, we study the computational complexity of a family of similarity measures based…
Two groups have a common model geometry if they act properly and cocompactly by isometries on the same proper geodesic metric space. The Milnor-Schwarz lemma implies that groups with a common model geometry are quasi-isometric; however, the…
Let $\Gamma$ be a finite graph, and for each vertex $i$ let $G_i$ be a finitely presented group. Let $G$ be the graph product of the $G_i$. That is, $G$ is the group obtained from the free product of the $G_i$ by factoring out by the…
We introduce a directed graph related to a group $G$, which we call the N-prime graph $\Gamma_{\rm{N}}(G)$ of $G$ and which is a refinement of the classical Gruenberg-Kegel graph. The vertices of $\Gamma_{\rm{N}}(G)$ are the primes $p$ such…
In his $1994$ survey, Kleinert defined formally and formulated the problem to obtain unit theorems for unit groups of orders in a semisimple algebra $A$. If $A$ is a group algebra $FG$, it boils down to classifying all finite groups $G$…