Related papers: Quadratic Tangles in Planar Algebras

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

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.

A planar Tangle is a smooth simple closed curve piecewise defined by quadrants of circles with constant curvature. We can enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks. The number of…

Given a planar algebra we show the equivalence of the notions of a module over this algebra (in the operadic sense), and module over a universal annular algebra. We classify such modules, with invariant inner products, in the generic region…

We define generalised notions of biunitary elements in planar algebras and show that objects arising in quantum information theory such as Hadamard matrices, quantum latin squares and unitary error bases are all given by biunitary elements…

This is the first of series of talks presented at a permanent Rutgers workshop on noncommutative algebra and geometry. We study here quadratic and quadratic-linear algebras defined by factorizations of noncommutative polynomials and…

In this note we show that abstract planar algebras are algebras over the topological operad of moduli spaces of stable maps with Lagrangian boundary conditions, which in the case of the projective line are described in terms of real…

We consider inclusions of type $(P\otimes A)^G\subset(P\otimes B)^G$, where $G$ is a compact quantum group of Kac type acting on a ${\rm II}_1$ factor $P$, and on a Markov inclusion of finite dimensional $C^*$-algebras $A\subset B$. In the…

The aim of this paper is to derive on the basis of the Euler's formula several analytical relations which hold for certain classes of planar graphs and which can be useful in algorithmic graph theory.

We generalize Jones' planar algebras by internalising the notion to a pivotal braided tensor category $\mathcal{C}$. To formulate the notion, the planar tangles are now equipped with additional `anchor lines' which connect the inner circles…

We investigate the problem of constructing planar drawings with few bends for two related problems, the partially embedded graph problem---to extend a straight-line planar drawing of a subgraph to a planar drawing of the whole graph---and…

We survey algorithms and bounds for constructing planar drawings of graphs in small area.

An inclusion of II$_1$ factors $N \subset M$ with finite Jones index gives rise to a powerful set of invariants that can be approached successfully in a number of different ways. We describe Jones' pictorial description of the standard…

A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…

In this paper, we construct the "2221" subfactor planar algebra by finding it as a subalgebra of the graph planar algebra of its principal graph. In particular, we give a presentation of the "2221" subfactor planar algebra consisting of…

We take a categorical approach to describe ternary derivations and ternary automorphisms of triangular algebras. New classes of automorphisms and derivations of triangular algebras are also introduced and studied.

Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…

A Lie algebra is said to be quadratic if it admits a symmetric invariant and non-degenerated bilinear form. Semisimple algebras with the Killing form are examples of these algebras, while orthogonal subspaces provide abelian quadatric…

This is a survey article for the forthcoming `A Concise Encyclopedia of Knot Theory.' We focus on the topology of spatial graphs with few vertices and edges, paying particular attention to Brunnian $\theta$-graphs.

We solve the subgraph isomorphism problem in planar graphs in linear time, for any pattern of constant size. Our results are based on a technique of partitioning the planar graph into pieces of small tree-width, and applying dynamic…