相关论文: Classification of exchange relation planar algebra…

The main purpose of this paper is to classify exchange relation planar algebras with 4 dimensional 2-boxes. Besides its skein theory, we emphasize the positivity of subfactor planar algebras based on the Schur product theorem. We will…

Bisch and Jones suggested the skein theoretic classification of planar algebras and investigated the ones generated by 2-boxes with the second author. In this paper, we consider 3-box generators and classify subfactor planar algebras…

We construct a new subfactor planar algebra, and as a corollary a new subfactor, with the `extended Haagerup' principal graph pair. This completes the classification of irreducible amenable subfactors with index in the range…

In this note, we discuss the notion of symmetric self-duality of shaded planar algebras, which allows us to lift shadings on subfactor planar algebras to obtain Z/2Z-graded unitary fusion categories. This finishes the proof that there are…

To allow for tractable probabilistic inference with respect to domain sizes, lifted probabilistic inference exploits symmetries in probabilistic graphical models. However, checking whether two factors encode equivalent semantics and hence…

Simon's factorization theorem is a celebrated tool in algebraic automata theory, providing bounded-depth decompositions of words with respect to morphisms into finite semigroups. We develop an analogue of Simon's theorem for \emph{forests}…

We strengthen a result of Dross, Montassier and Pinlou (2017) that the vertex set of every triangle-free planar graph can be decomposed into a set that induces a forest and a set that induces a forest with maximum degree at most $5$,…

Cluster algebras have recently become an important player in mathematics and physics. In this work, we investigate them through the lens of modern data science, specifically with techniques from network science and machine learning. Network…

A graph is called pseudo-outerplanar if each block has an embedding on the plane in such a way that the vertices lie on a fixed circle and the edges lie inside the disk of this circle with each of them crossing at most one another. In this…

We introduce a novel interpretable tree based algorithm for prediction in a regression setting. Our motivation is to estimate the unknown regression function from a functional decomposition perspective in which the functional components…

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

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…

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…

Bipartite graphs model the relationship between two disjoint sets of objects. They have a wide range of applications and are often visualized as a 2-layered drawing, where each set of objects is visualized as a set of vertices (points) on…

Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of species, and this motivates the use of distance measures to…

This paper studies how to use relation algebras, which are useful for high-level specification and verification, for proving the correctness of lower-level array-based implementations of algorithms. We give a simple relation-algebraic…

An $({\cal F},{\cal F}_d)$-partition of a graph is a vertex-partition into two sets $F$ and $F_d$ such that the graph induced by $F$ is a forest and the one induced by $F_d$ is a forest with maximum degree at most $d$. We prove that every…

Spectral clustering views the similarity matrix as a weighted graph, and partitions the data by minimizing a graph-cut loss. Since it minimizes the across-cluster similarity, there is no need to model the distribution within each cluster.…

We give the classification of subfactor planar algebras at index exactly 5. All the examples arise as standard invariants of subgroup subfactors. Some of the requisite uniqueness results come from work of Izumi in preparation. The…

Finding Minimal Unsatisfiable Subsets (MUSes) of binary constraints is a common problem in infeasibility analysis of over-constrained systems. However, because of the exponential search space of the problem, enumerating MUSes is extremely…