Related papers: Rigid Graph Products

We introduce "embedding dimensions" of a family of generators of a finite von Neumann algebra when the von Neumann algebra can be faithfully embedded into the ultrapower of the hyperfinite II$_1$ factor. These embedding dimensions are von…

Let $M$ be a finite von Neumann algebra with the Haagerup property, and let $G$ be a compact group that acts continuously on $M$ and that preserves some finite trace $\tau$. We prove that if $\Gamma$ is a countable subgroup of $G$ which has…

Let $d \geq 1$ be an integer. From a set of $d$-dimensional vectors, we obtain a $d$-\dpg\ by letting each vector $\va^u$ correspond to a vertex $u$ and by adding an edge between two vertices $u$ and $v$ if and only if their dot product…

In this paper, we study the Cartesian product of signed graphs as defined by Germina, Hameed and Zaslavsky (2011). Here we focus on its algebraic properties and look at the chromatic number of some Cartesian products. One of our main…

Let $G$ be a connected graph. A vertex $w$ strongly resolves a pair $u$, $v$ of vertices of $G$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $W$ of vertices is a strong resolving…

The rigidity degree of a generator-cogenerator determines the dominant dimension of its endomorphism algebra, and is closely related to a recently introduced homological dimension -- rigidity dimension. In this paper, we give explicit…

This is the first paper of a three-part series in which we develop a theory of conformal blocks for $C_2$-cofinite vertex operator algebras (VOAs) that are not necessarily rational. The ultimate goal of this series is to prove a…

A graph $G=(V,E)$ is called $d$-rigid if, for a generic embedding of its vertices in $\mathbb{R}^d$, every edge-length preserving continuous motion of the vertices preserves the distances between all pairs of non-adjacent vertices as well.…

We introduce notation Q(1) * ... * Q(n) * L(F_r)$ for von Neumann algebra II_1 factors where $r$ is allowed to be negative. This notation is defined by rescalings of free products of II_1 factors, and is proved to be consistent with known…

For a given graph $R$, a graph $G$ is $R$-free if $G$ does not contain $R$ as an induced subgraph. It is known that every $2$-tough graph with at least three vertices has a $2$-factor. In graphs with restricted structures, it was shown that…

We study minimum degree conditions that guarantee that an $n$-vertex graph is rigid in $\mathbb{R}^d$. For small values of $d$, we obtain a tight bound: for $d = O(\sqrt{n})$, every $n$-vertex graph with minimum degree at least $(n+d)/2 -…

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…

In the study of holomorphic maps, the term "rigidity" refers to certain types of results that give us very specific information about a general class of holomorphic maps owing to the geometry of their domains or target spaces. Under this…

We show that any graph product of residually finite monoids is residually finite. As a special case we obtain that any free product of residually finite monoids is residually finite. The corresponding results for graph products of…

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

We show that indecomposable weak Kac algebras are free over their Cartan subalgebras and prove a duality theorem for their actions. Using this result, for any biconnected weak Kac algebra we construct a minimal action on the hyperfinite…

We show that if G is a discrete group which does not have the Haagerup property but does have an unbounded cocycle into a C_0 representation and if G acts on a finite von Neumann algebra B such that the inclusion B \subset (B \rtimes G) has…

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.…

We establish the tracial stability of a certain class of graph products of C*-algebras. This result involves the development of the "pincushion class" of finite graphs. We then apply this result in two ways. The first application yields a…

In this article we investigate the primeness of generalized wreath product II$_1$ factors using deformation/rigidity theory techniques. We give general conditions relating tensor decompositions of generalized wreath products to stabilizers…