English
Related papers

Related papers: Rigid Graph Products

200 papers

Let $(\Gamma,\mu)$ be a bipartite graph together with a weight on its vertices. Assume that $\mu$ is an eigenvector for the adjacency matrix of $\Gamma$. Let Aut$(\Gamma, \mu)$ be the automorphism group of the bipartite graph $\Gamma$ that…

Operator Algebras · Mathematics 2016-02-15 Arnaud Brothier

Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…

Rings and Algebras · Mathematics 2026-05-12 Joakim Arnlind , Stefan Wagner

We introduce a wide class of countable groups, called properly proximal, which contains all non-amenable bi-exact groups, all non-elementary convergence groups, and all lattices in non-compact semi-simple Lie groups, but excludes all inner…

Operator Algebras · Mathematics 2018-11-15 Rémi Boutonnet , Adrian Ioana , Jesse Peterson

This paper is the continuation of the research of the author and his colleagues of the {\it canonical} decomposition of graphs. The idea of the canonical decomposition is to define the binary operation on the set of graphs and to represent…

Combinatorics · Mathematics 2016-07-19 Pavel Skums

We prove that every separable tracial von Neumann algebra embeds into a II$_1$ factor with property (T) which can be taken to have trivial outer automorphism and fundamental groups. We also establish an analogous result for the trivial…

Operator Algebras · Mathematics 2022-05-17 Ionut Chifan , Daniel Drimbe , Adrian Ioana

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

Computational Complexity · Computer Science 2009-12-31 Marco Pedicini , Mario Piazza

A conjecture of Kadison and Kastler from 1972 asks whether sufficiently close operator algebras in a natural uniform sense must be small unitary perturbations of one another. For $n\geq 3$ and a free ergodic probability measure preserving…

Operator Algebras · Mathematics 2015-08-26 Jan Cameron , Erik Christensen , Allan M. Sinclair , Roger R. Smith , Stuart White , Alan D. Wiggins

In this paper we study the variability and rigidity of secondary characteristic classes which arise from flat connections on a manifold. Considering the connection as a Lie-algebra valued one-form, we study the characteristic map from Lie…

Differential Geometry · Mathematics 2007-05-23 Jerry Lodder

We study the question how quickly products of a fixed conjugacy class in the projective unitary group of a II${}_1$-factor von Neumann algebra cover the entire group. Our result is that the number of factors that are needed is essentially…

Operator Algebras · Mathematics 2015-08-13 Philip A. Dowerk , Andreas Thom

This paper collates, presents, and expands upon technology and results obtained as part of the author's PhD thesis. We generalize work done in the $\sigma$-finite setting by the author, Goldbring, Hart, and Sinclair by producing a language…

Operator Algebras · Mathematics 2025-08-26 Jananan Arulseelan

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

Rings and Algebras · Mathematics 2019-04-10 P. Ara , J. Bosa , E. Pardo

We prove that for any group G in a fairly large class of generalized wreath product groups, the associated von Neumann algebra L(G) completely "remembers" the group G. More precisely, if L(G) is isomorphic to the von Neumann algebra…

Operator Algebras · Mathematics 2012-08-21 Adrian Ioana , Sorin Popa , Stefaan Vaes

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…

Operator Algebras · Mathematics 2014-02-26 Dilian Yang

In this paper we study conditions under which, for an inclusion of finite von Neumann algebras $N \subseteq M$, we have the reduced amalgamated free product $\ast_N M$ is embeddable into $(R \bar{\otimes} N_1)^\omega$ for some other finite…

Operator Algebras · Mathematics 2021-12-07 Weichen Gao , Marius Junge , Weichen Gao

Let $G$ be a noncompact semisimple algebraic group with trivial center, $S < G$ a maximal split torus, $H < G$ the centralizer of $S$ in $G$ and $\Gamma < G$ an irreducible lattice. Consider the group measure space von Neumann algebra…

Operator Algebras · Mathematics 2026-05-21 Cyril Houdayer , Adrian Ioana

Let $M$ be a finite von Neumann algebra (resp. a type II$_{1}$ factor) and let $N\subset M$ be a II$_{1}$ factor (resp. $N\subset M$ have an atomic part). We prove that the inclusion $N\subset M$ is amenable implies the identity map on $M$…

Operator Algebras · Mathematics 2018-09-05 Xiaoyan Zhou , Junsheng Fang

We use malleable deformations combined with spectral gap rigidity theory, in the framework of Popa's deformation/rigidity theory to prove unique tensor product decomposition results for II$_1$ factors arising as tensor product of wreath…

Operator Algebras · Mathematics 2016-01-20 James Owen Sizemore , Adam Winchester

Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…

Data Structures and Algorithms · Computer Science 2022-04-26 Michael A. Bekos , Giordano Da Lozzo , Petr Hliněný , Michael Kaufmann

Let C be an integral fusion category. We study some graphs, called the prime graph and the common divisor graph, related to the Frobenius-Perron dimensions of simple objects in the category C, that extend the corresponding graphs associated…

Quantum Algebra · Mathematics 2014-11-18 Sonia Natale , Edwin Pacheco

In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph~$G$ with adjacency matrix…

Data Structures and Algorithms · Computer Science 2025-11-06 Luca Calderoni , Luciano Margara , Moreno Marzolla