相关论文: Calculating two-strand jellyfish relations

In this paper we consider graphs whose edges are associated with a degree of {\em importance}, which may depend on the type of connections they represent or on how recently they appeared in the scene, in a streaming setting. The goal is to…

Jones and Penneys showed that a finite depth subfactor planar algebra embeds in the bipartite graph planar algebra of its principal graph, via a Markov towers of algebras approach. We relate several equivalent perspectives on the notion of…

In these lectures we explain the intimate relationship between modular invariants in conformal field theory and braided subfactors in operator algebras. A subfactor with a braiding determines a matrix $Z$ which is obtained as a coupling…

We study selfadjoint functors acting on categories of finite dimensional modules over finite dimensional algebras with an emphasis on functors satisfying some polynomial relations. Selfadjoint functors satisfying several easy relations, in…

In 2014 Jones showed how to associate links in the $3$-sphere to elements of Thompson's group $F$. We provide an analogue of this program for annular links and Thompson's group $T$. The main result is that any edge-signed graph embedded in…

A bi-unitary connection in subfactor theory of Jones producing a subfactor of finite depth gives a 4-tensor appearing in a recent work of Bultinck-Mariena-Williamson-Sahinoglu-Haegemana-Verstraete on 2-dimensional topological order and…

We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…

In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.

Given a formal context, an ordinal factor is a subset of its incidence relation that forms a chain in the concept lattice, i.e., a part of the dataset that corresponds to a linear order. To visualize the data in a formal context, Ganter and…

Various generalizations of Cuntz algebras and their relations to symmetry and duality are reviewed. New generalized Cuntz algebras are associated with a subfactor. A characteristic Hilbert space of basic invariants (with respect to the…

The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…

In this work we propose the construction of two-channel wavelet filterbanks for analyzing functions defined on the vertices of any arbitrary finite weighted undirected graph. These graph based functions are referred to as graph-signals as…

We define Jones's planar algebra as a map of multicategories and constuct a planar algebra starting from a 1-cell in a pivotal strict 2-category. We prove finiteness results for the affine representations of finite depth planar algebras. We…

Subfactors where the initial branching point of the principal graph is 3-valent are subject to strong constraints called triple point obstructions. Since more complicated initial branches increase the index of the subfactor, triple point…

We give an identification between the planar algebra of the subgroup-subfactor $R \rtimes H \subset R \rtimes G$ and the $G$-invariant planar subalgebra of the planar algebra of the bipartite graph $\star_n$, where $n = [G : H]$. The…

We prove existence of subfactors of finite depth of the hyperfinite II_1 factor with indices (5+sqrt{13})/2= 4.302... and (5+sqrt{17})/2=4.561.... The existence of the former was announced by the second named author in 1993 and that of the…

In large datasets, it is hard to discover and analyze structure. It is thus common to introduce tags or keywords for the items. In applications, such datasets are then filtered based on these tags. Still, even medium-sized datasets with a…

We consider factoring low-rank tensors in the presence of outlying slabs. This problem is important in practice, because data collected in many real-world applications, such as speech, fluorescence, and some social network data, fit this…

We generalize the problem of reconstructing strings from their substring compositions first introduced by Acharya et al. in 2015 motivated by polymer-based advanced data storage systems utilizing mass spectrometry. Namely, we see strings as…

The Kuperberg Program asks to find presentations of planar algebras and use these presentations to prove results about their corresponding categories purely diagrammatically. This program has been completed for index less than 4 and is…