Related papers: Constructing the extended Haagerup planar algebra

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…

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 task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms 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…

There is a graph reduction system so that every optimal 1-planar graph can be reduced to an irreducible extended wheel graph, provided the reductions are applied such that the given graph class is preserved. A graph is optimal 1-planar if…

The success of graph neural networks (GNNs) provokes the question about explainability: ``Which fraction of the input graph is the most determinant of the prediction?'' Particularly, parametric explainers prevail in existing approaches…

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

We study the recognition complexity of subgraphs of k-connected planar cubic graphs for k = 1, 2, 3. We present polynomial-time algorithms to recognize subgraphs of 1- and 2-connected planar cubic graphs, both in the variable and fixed…

A bipartite graph is {\em pseudo 2--factor isomorphic} if all its 2--factors have the same parity of number of circuits. In \cite{ADJLS} we proved that the only essentially 4--edge-connected pseudo 2--factor isomorphic cubic bipartite graph…

We study the four infinite families KA(n), KB(n), KD(n), KQ(n) of finite dimensional Hopf (in fact Kac) algebras constructed respectively by A. Masuoka and L. Vainerman: isomorphisms, automorphism groups, self-duality, lattices of coideal…

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…

We introduce fusion, contragradient and braiding of Hilbert affine representations of a subfactor planar algebra $P$ (not necessarily having finite depth). We prove that if $N \subset M$ is a subfactor realization of $P$, then the Drinfeld…

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…

In 1967 Kasteleyn introduced a powerful method for enumerating the 1-factors of planar graphs. In fact his method can be extended to graphs which permit an orientation under which every alternating circuit is clockwise odd. Graphs with this…

A graph of order $n$ is said to be \emph{$k$-factor-critical} ($0\leq k <n$) if the removal of any $k$ vertices results in a graph with a perfect matching. A $k$-factor-critical graph $G$ is \emph{minimal} if $G-e$ is not…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…

In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…

There is a well-known construction of a Jordan algebra via a sharped cubic form. We introduce a generalized sharped cubic form and prove that the split spin factor algebra is induced by this construction and satisfies the identity…

We establish that a simple polynomial-time algorithm that we call reweighted spectral partitioning obtains small 2/3-balanced vertex-separators for a number of graph classes, including $O(\sqrt{n})$-sized separators for planar graphs,…