Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Patchell, Gregory"'
For every $n\in \mathbb{N}$ we obtain a separable II$_1$ factor $M$ and a maximally abelian subalgebra $A\subset M$ such that the space of maximally amenable extensions of $A$ in $M$ is affinely identified with the $n$ dimensional $\mathbb{R}$-simple
Externí odkaz:
http://arxiv.org/abs/2410.11788
We extract a precise internal description of the sequential commutation equivalence relation introduced in [KEP23] for tracial von Neumann algebras. As an application we prove that if a tracial von Neumann algebra $N$ is generated by unitaries $\{u_i
Externí odkaz:
http://arxiv.org/abs/2404.12380
We study conjugacy orbits of certain types of subalgebras in tracial von Neumann algebras. For any separable II$_1$ factor $N_0$ we construct a highly indecomposable non Gamma II$_1$ factor $N$ such that $N_0 \subset N$ and moreover every von Neumann
Externí odkaz:
http://arxiv.org/abs/2403.08072
In this article we develop a notion of soficity for actions of countable groups on sets. We show two equivalent perspectives, several natural properties and examples. Notable examples include arbitrary actions of both amenable groups and free groups,
Externí odkaz:
http://arxiv.org/abs/2401.04945
Recall that a unitary in a tracial von Neumann algebra is Haar if $\tau(u^n)=0$ for all $n\in \mathbb{N}$. We introduce and study a new Borel equivalence relation $\sim_N$ on the set of Haar unitaries in a diffuse tracial von Neumann algebra $N$. Two
Externí odkaz:
http://arxiv.org/abs/2311.06392
Autor:
Patchell, Gregory
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 of the ass
Externí odkaz:
http://arxiv.org/abs/2305.07841
Autor:
Patchell, Gregory, Spiro, Sam
How can you fill a $3\times 3$ grid with the letters A and M so that the word ``AMM'' appears as many times as possible in the grid? More generally, given a word $w$ of length $n$, how can you fill an $n\times n$ grid so that $w$ appears as many time
Externí odkaz:
http://arxiv.org/abs/2207.11273