Related papers: Rigidity for graph product von Neumann algebras

The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…

We show that if $G$ is a group and $G$ has a graph-product decomposition with finitely-generated abelian vertex groups, then $G$ has two canonical decompositions as a graph product of groups: a unique decomposition in which each vertex…

A topological group $G$ is called extremely amenable if every continuous action of $G$ on a compact space has a fixed point. This concept is linked with geometry of high dimensions (concentration of measure). We show that a von Neumann…

We consider homological finiteness properties $FP_n$ of certain $\mathbb{N}$-graded Lie algebras. After proving some general results, see Theorem A, Corollary B and Corollary C, we concentrate on a family that can be considered as the Lie…

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…

Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$…

Let $V$ and $V'$ be vector spaces of dimension $n$ and $n'$, respectively. Let $k\in\{2,...,n-2\}$ and $k'\in\{2,...,n'-2\}$. We describe all isometric and $l$-rigid isometric embeddings of the Grassmann graph $\Gamma_{k}(V)$ in the…

The graph product of a family of groups lies somewhere between their direct and free products, with the graph determining which pairs of groups commute and which do not. We show that the graph product of quasi-lattice ordered groups is…

Building on work of Cai, F\"urer, and Immerman \cite{CFI92}, we show two hardness results for the Graph Isomorphism problem. First, we show that there are pairs of nonisomorphic $n$-vertex graphs $G$ and $H$ such that any sum-of-squares…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

In this paper, we develop a $\times$-homotopy fundamental groupoid for graphs, and show a functorial relationship to the 2-category of graphs. We further explore the fundamental groupoid of graph products and develop a groupoid product…

We show that any compact group can be realized as the outer automorphism group of a factor of type II_1. This has been proved in the abelian case by Ioana, Peterson and Popa applying Popa's deformation/rigidity techniques to amalgamated…

Let $\Fth$ be a 2 graph generated by $m$ blue edges and $n$ red edges, and $\omega$ be the distinguished faithful state associated with its graph C*-algebra $\O_\theta$. In this paper, we characterize the factorness of the von Neumann…

The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…

We study the von Neumann algebra, generated by the unitary representations of infinite-dimensional groups nilpotent group $B_0^{\mathbb N}$. The conditions of the irreducibility of the regular and quasiregular representations of…

Let $(A, \oplus, *, 0)$ be an MV-algebra, $(A, \odot, 0)$ be the associated commutative semigroup, and $I$ be an ideal of $A$. Define the ideal-based zero-divisor graph $\Gamma_{I}(A)$ of $A$ with respect to $I$ to be a simple graph with…

We consider the general linear group as an invariant of von Neumann factors. We prove that up to complement, a set consisting of all idempotents generating the same right ideal admits a characterisation in terms of properties of the general…

We develop a relative boundary theory for actions of discrete groups on compact spaces and use it to derive rigidity results for reduced crossed products. For a discrete group $\Gamma$ acting on a compact space $X$ and a subgroup $H$, we…

For a group $G$, the generating graph $\Gamma(G)$ is defined as the graph with the vertex set $G$, and any two distinct vertices of $\Gamma(G)$ are adjacent if they generate $G$. In this paper, we study the generating graph of $D_n,$ where…

Let $G$ be a graph and suppose we are given, for each $v \in V(G)$, a strict ordering of the neighbors of $v$. A set of matchings ${\cal M}$ of $G$ is called internally stable if there are no matchings $M,M' \in {\cal M}$ such that an edge…