Related papers: Constructing the extended Haagerup planar algebra

In 2000, Dergachev and Kirillov introduced subalgebras of "seaweed type" in $\mathfrak{gl}_n$ and computed their index using certain graphs, which we call type-${\sf A}$ meander graphs. Then the subalgebras of seaweed type, or just…

We define a category of planar diagrams whose Grothendieck group contains an integral version of the infinite rank Heisenberg algebra, thus yielding a categorification of this algebra. Our category, which is a q-deformation of one defined…

A graph $G$ is $k$-degenerate if it can be transformed into an empty graph by subsequent removals of vertices of degree $k$ or less. We prove that every connected planar graph with average degree $d \ge 2$ has a 4-degenerate induced…

We construct a Hopf algebra structure on the space of specified Feynman graphs of a quantum field theory. We introduce a convolution product and a semigroup of characters of this Hopf algebra with values in some suitable commutative algebra…

We have sorted the SmallGroups library of all the finite groups of order smaller than 2000 to identify the groups that possess a faithful three-dimensional irreducible representation (`irrep') and cannot be written as the direct product of…

I introduce yet another way to associate a C*-algebra to a graph and construct a simple nuclear C*-algebra that has irreducible representations both on a separable and a nonseparable Hilbert space.

It follows from the work of Tait and the Four-Color-Theorem that a planar cubic graph is 3-edge-colorable if and only if it contains no bridge. We consider the question of which planar graphs are subgraphs of planar cubic bridgeless graphs,…

Given a simple connected undirected graph G = (V, E), a set X \subseteq V(G), and integers k and p, STEINER SUBGRAPH EXTENSION problem asks if there exists a set S \supseteq X with at most k vertices such that G[S] is p-edge-connected. This…

We construct irreducible hyperfinite subfactors of index 6 with a prescribed fundamental group from a large family containing all countable and many uncountable subgroups of R_+. We also prove that there are unclassifiably many irreducible…

In this first work dedicated to the generalisation of classic algebraic geometry to non algebraically closed fields and axiomatisable classes of fields, we develop the foundations for equiresidual algebraic geometry (EQAG), i.e. algebraic…

A graph is $1$-$planar$ if it can be drawn in the plane so that each edge is crossed by at most one other edge. Moreover, a 1-planar graph $G$ is $optimal$ if it satisfies $|E(G)|=4|V(G)|-8$. J. Fujisawa et al. [16] first considered…

Product structure theorems are a collection of recent results that have been used to resolve a number of longstanding open problems on planar graphs and related graph classes. One particularly useful version states that every planar graph…

For any finite graph Gamma and any field K of characteristic unequal to 2 we construct an algebraic variety X over K whose K-points parameterise K-Lie algebras generated by extremal elements, corresponding to the vertices of the graph, with…

We introduce singular subalgebroids of an integrable Lie algebroid, extending the notion of Lie subalgebroid by dropping the constant rank requirement. We lay the bases of a Lie theory for singular subalgebroids: we construct the associated…

We revisit G. Elek's notion of amenable representation type, where algebras are characterised by every indecomposable module being "almost" the direct sum of modules of bounded dimension. We give a new proof of his result that string…

A vertex k-labeling of graph G is distinguishing if the only automorphism that preserves the labels of G is the identity map. The distinguishing number of G, D(G), is the smallest integer k for which G has a distinguishing k-labeling. In…

We construct subfactors where one of the principal graphs is a spoke graph using an algorithm which computes two-strand jellyfish relations. One of the subfactors we construct is a 3^{Z/4} subfactor known to Izumi, which has not previously…

Graph-based semi-supervised learning is a powerful paradigm in machine learning for modeling and exploiting the underlying graph structure that captures the relationship between labeled and unlabeled data. A large number of classical as…

We introduce and study an affine analogue of skew Young diagrams and tableaux on them. It turns out that the double affine Hecke algebra of type $A$ acts on the space spanned by standard tableaux on each diagram. It is shown that the…

A planar graph $G$ is said to be non-separating if there exists an embedding of $G$ in $\mathbb{R}^2$ such that for any cycle $\mathcal{C}\subset G$, all vertices of $G\setminus \mathcal{C}$ are within the same connected component of…