Related papers: Calculating two-strand jellyfish relations
We summarize the known obstructions to subfactors with principal graphs which begin with a triple point. One is based on Jones's quadratic tangles techniques, although we apply it in a novel way. The other two are based on connections…
We introduce a notion of planar algebra, the simplest example of which is a vector space of tensors, closed under planar contractions. A planar algebra with suitable positivity properties produces a finite index subfactor of a II_1 factor,…
This article proves the existence and uniqueness of a subfactor planar algebra with principal graph consisting of a diamond with arms of length 2 at opposite sides, which we call 2D2. We also prove the uniqueness of the subfactor planar…
We describe the subfactor planar algebra of an intermediate subfactor $N\subset Q \subset M$ of an extremal subfactor $N\subset M$ of finite Jones index which is not necessarily irreducible.
By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.
We develop an analog of Jones' planar calculus for II_1-factor bimodules with arbitrary left and right von Neumann dimension. We generalize to bimodules Burns' results on rotations and extremality for infinite index subfactors. These…
We describe an explicit finite presentation for a finite depth subfactor planar algebra. We also show that such planar algebras are singly generated with the generator subject to finitely many relations.
In this paper, we present new incremental algorithms for maintaining data structures that represent all connectivity cuts of size one in directed graphs (digraphs), and the strongly connected components that result by the removal of each of…
Let $G$ be a cubic graph admitting a $2$-factor consisting of exactly two odd circuits, and let the complementary $1$-factor contain precisely three spokes (along with an arbitrary number of chords). We show that four perfect matchings can…
We consider cubic graphs formed with $k \geq 2$ disjoint claws $C_i \sim K_{1, 3}$ ($0 \leq i \leq k-1$) such that for every integer $i$ modulo $k$ the three vertices of degree 1 of $\ C_i$ are joined to the three vertices of degree 1 of…
We compute exactly various 4-point correlation functions of shortest scalar operators in bi-scalar planar four-dimensional "fishnet" CFT. We apply the OPE to extract from these functions the exact expressions for the scaling dimensions and…
We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by…
The $k$-cut problem asks, given a connected graph $G$ and a positive integer $k$, to find a minimum-weight set of edges whose removal splits $G$ into $k$ connected components. We give the first polynomial-time algorithm with approximation…
We investigate a (potentially infinite) series of subfactors, called $3^n$ subfactors, including $A_4$, $A_7$, and the Haagerup subfactor as the first three members corresponding to $n=1,2,3$. Generalizing our previous work for odd $n$, we…
We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…
The graphical operation of insplitting is key to understanding conjugacy of shifts of finite type (SFTs) in both one and two dimensions. In this paper, we consider two approaches to studying 2-dimensional SFTs: textile systems and rank-2…
Analogous to the sl(n) case, we address the computation of the index of seaweed subalgebras of sp(2n) by introducing graphical representations called symplectic meanders. Formulas for the algebra's index may be computed by counting the…
We give generators and relations for the planar algebras corresponding to $ADE$ subfactors. We also give a basis and an algorithm to express an arbitrary diagram as a linear combination of these basis diagrams.
A linear-time algorithm for generating auxiliary subgraphs for the 3-edge-connected components of a connected multigraph is presented. The algorithm uses an innovative graph contraction operation and makes only one pass over the graph. By…
We construct the quantum s-tuple subfactors for an AFD II_1 subfactor with finite index and depth, for an arbitrary natural number s. This is a generalization of the quantum multiple subfactors by J.Erlijman and H.Wenzl, which generalizes…