Related papers: Calculating two-strand jellyfish relations
Representations of braid group obtained from rational conformal field theories can be used to obtain explicit representations of Temperley-Lieb-Jones algebras. The method is described in detail for SU(2)$_k$ Wess - Zumino conformal field…
We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with…
A theory is developed which uses "networks" (directed acyclic graphs with some extra structure) as a formalism for expressions in multilinear algebra. It is shown that this formalism is valid for arbitrary PROPs (short for 'PROducts and…
We present the first parallel fixed-parameter algorithm for subgraph isomorphism in planar graphs, bounded-genus graphs, and, more generally, all minor-closed graphs of locally bounded treewidth. Our randomized low depth algorithm has a…
We modify the pre-factor of the semiclassical propagator to improve its efficiency in practical implementations. The new pre-factor represents the smooth portion of an orbit's contribution, and leads to fast convergence in numerical…
We obtain a polynomial-time 17/12-approximation algorithm for the minimum-cost 2-vertex-connected spanning subgraph problem, restricted to graphs of minimum degree at least 3. Our algorithm uses the framework of ear-decompositions for…
Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known…
The explicit McKay correspondence, as formulated by Gonzalez-Sprinberg and Verdier, associates to each exceptional divisor in the minimal resolution of a rational double point a matrix factorization of the equation of the rational double…
Planar functions over finite fields give rise to finite projective planes. They were also used in the constructions of DES-like iterated ciphers, error-correcting codes, and codebooks. They were originally defined only in finite fields with…
Bisch and Jones proposed the classification of planar algebras by simple generators and relations. In this paper, we study the generating problem for a family of group-subgroup subfactors associated with the Kneser graphs, namely, to…
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometric spanner with stretch factor $C_{del\approx 2.42$; however,…
Guionnet et al. gave a construction of a II_1 factor associated to a subfactor planar algebra. In this paper we define an unshaded planar algebra. To any unshaded planar algebra P we associate a finite von Neumann algebra M_P. We prove that…
In 1956, Tutte proved the celebrated theorem that every 4-connected planar graph is hamiltonian. This result implies that every more than $\frac{3}{2}$-tough planar graph on at least three vertices is hamiltonian and so has a 2-factor.…
This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each…
We construct a group measure space II$_1$ factor that has two non-conjugate Cartan subalgebras. We show that the fundamental group of the II$_1$ factor is trivial, while the fundamental group of the equivalence relation associated with the…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…
While string or Yang-Mills theories are based on Lie algebra or two-algebra structure, recent studies indicate that M-theory may require a one higher, three-algebra structure. Here we construct a covariant action for a supermembrane in…
In this paper we further develop the theory of $\alpha$-induction for nets of subfactors, in particular in view of the system of sectors obtained by mixing the two kinds of induction arising from the two choices of braiding. We construct a…
Two-sided group digraphs and graphs, introduced by Iradmusa and Praeger, provide a generalization of Cayley digraphs and graphs in which arcs are determined by left and right multiplying by elements of two subsets of the group. We…
With each semisimple algebra it is possible to connect the system of interacting waves. The number of interacting fields coincides with the number of positive roots of corresponding semisimple algebra. Multisoliton solution of such kind…