Related papers: Constructing the extended Haagerup planar algebra

Let $G$ be a graph with vertex set $V(G)$. Let $n$ and $k$ be non-negative integers such that $n + 2k \leq |V(G)| - 2$ and $|V(G)| - n$ is even. If when deleting any $n$ vertices of $G$ the remaining subgraph contains a matching of $k$…

Using an analogue of the Guionnet-Jones-Shlaykhtenko construction for graphs we show that their construction applied to any subfactor planar algebra of finite depth yields an inclusion of interpolated free group factors with finite…

Let A be a Hopf algebra and H a coalgebra. We shall describe and classify up to an isomorphism all Hopf algebras E that factorize through A and H: that is E is a Hopf algebra such that A is a Hopf subalgebra of E, H is a subcoalgebra in E…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

In 1988, I. Beck introduced the notion of a zero-divisor graph of a commutative rings with $1$. There have been several generalizations in recent years. In particular, in 2007 J. Coykendall and J. Maney developed the irreducible divisor…

This article focuses on a combinatorial structure specific to triangulated plane graphs with quadrangular outer face and no separating triangle, which are called irreducible triangulations. The structure has been introduced by Xin He under…

A graph $G$ is a non-separating planar graph if there is a drawing $D$ of $G$ on the plane such that (1) no two edges cross each other in $D$ and (2) for any cycle $C$ in $D$, any two vertices not in $C$ are on the same side of $C$ in $D$.…

Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…

An approach to the enumeration of feasible parameters for strongly regular graphs is described, based on the pair of structural parameters (a,c) and the positive eigenvalue e. The Krein bound ensures that there are only finitely many…

In an earlier paper, we introduced ``bordered knot algebras'', which are graded algebras indexed by a pair of integers (m,k). In a subsequent paper, we introduced a two-parameter family of differential graded algebra, the ``pong algebras'',…

We construct new hyperfinite subfactors with Temperley-Lieb-Jones (TLJ) standard invariant and Jones indices between $4$ and $3 + \sqrt{5}$. Our subfactors occur at all indices between $4$ and $5$ at which finite depth, hyperfinite…

We introduce and develop equivalent spectral graph theory for several fundamental graph cut problems including maxcut, mincut, Cheeger cut, anti-Cheeger cut, dual Cheeger problem and their useful variants. A specified strategy for achieving…

Recently, subgraphs-enhanced Graph Neural Networks (SGNNs) have been introduced to enhance the expressive power of Graph Neural Networks (GNNs), which was proved to be not higher than the 1-dimensional Weisfeiler-Leman isomorphism test. The…

We study the random planar graph process introduced by Gerke, Schlatter, Steger, and Taraz [The random planar graph process, Random Structures Algorithms 32 (2008), no. 2, 236--261; MR2387559]: Begin with an empty graph on $n$ vertices,…

We consider the class F of 2-connected non-planar K_{3,3}-subdivision-free graphs that are embeddable in the projective plane. We show that these graphs admit a unique decomposition as a graph K_5 (the core) where the edges are replaced by…

We show that Hilbert schemes of planar curve singularities and their parabolic variants can be interpreted as certain generalized affine Springer fibers for $GL_n$, as defined by Goresky-Kottwitz-MacPherson. Using a generalization of affine…

We define a special type of hypersurface varieties inside $\mathbb{P}_k^{n-1}$ arising from connected planar graphs and then find their equivalence classes inside the Gr\"othendieck ring of projective varieties. Then we find a…

We summarize the known obstructions to subfactors with principal graphs which begin with a triple point. One is based on Jones's quadratic tangles techniques, although we apply it in a novel way. The other two are based on connections…

Given a graph $G$, the maximal induced subgraphs problem asks to enumerate all maximal induced subgraphs of $G$ that belong to a certain hereditary graph class. While its optimization version, known as the minimum vertex deletion problem in…

Generalized connectivity introduced by Hager (1985) has been studied extensively in undirected graphs and become an established area in undirected graph theory. For connectivity problems, directed graphs can be considered as generalizations…