Related papers: Calculating two-strand jellyfish relations
We study factorizations of HOMFLY polynomials of certain knots and oriented links. We begin with a computer analysis of knots with at most 12 crossings, finding 17 non-trivial factorizations. Next, we give an irreducibility criterion for…
We study relations between cluster algebra invariants and link invariants. First, we show that several constructions of positroid links (permutation links, Richardson links, grid diagram links, plabic graph links) give rise to isotopic…
Recently, we have introduced and studied the topic of sub-indices and sub-factors of groups. During those studies, an algorithm for obtaining the sub-factors of a finite group was stated and proved, which has a particular case for…
Here, we define a subdivision operation for a hypergraph and compute all the eigenvalues of the subdivision of regular and certain non-regular hypergraphs. In non-regular hypergraphs, we investigate the power of regular graphs, various…
Geometry arising from two diffusion operators (smooth semi-elliptic, second order differential operators) on different spaces but intertwined by a smooth map is described. Particular cases arise from Riemannian submersions when the…
Term graph rewriting provides a formalism for implementing term rewriting in an efficient manner by avoiding duplication. Infinitary term rewriting has been introduced to study infinite term reduction sequences. Such infinite reductions can…
We use annular foam TQFTs introduced by the first two authors to define equivariant $SL(2)$ and $SL(3)$ web algebras in the annulus. To a diagram of a tangle in the thickened annulus we assign a complex of bimodules over these algebras…
We introduce 3-irreducible modules, even roots and odd roots for Leibniz algebras, produce a basis for a root space of a Leibniz algebra with a semisimple Lie factor, and classify finite dimensional simple Leibniz algebras with Lie factor…
We enumerate factorisations of the complete bipartite graph into spanning semiregular graphs in several cases, including when the degrees of all the factors except one or two are small. The resulting asymptotic behaviour is seen to…
The evolution of the Internet during the last years, has lead to a dramatic increase of the size of its graph at the Autonomous System (AS) level. Soon - if not already - its size will make the latter impractical for use from the research…
We show that the Jones-Wassermann subfactors for disconnected intervals, which are constructed from the representations of loop groups of type $A$, are finite-depth subfactors. The index value and the dual principal graphs of these…
We provide a framework to triangulate subfactor categories of additive categories with additive endofunctors. It is proved that such a framework is sufficiently flexible to cover many instances in algebra and geometry where abelian, exact…
For any abstract subfactor planar algebra $P$, there exists a finite index extremal subfactor $M_0 \subset M_1$ with $P$ as its standard invariant. In this paper, we classify the automorphism group of a bipartite graph planar algebra, and…
The classical $\mathrm{AGM}$ produces wonderful interdependent infinite sequences of arithmetic and geometric means with common limit. For finite fields $\mathbb{F}_q,$ with $q\equiv 3\pmod 4,$ we introduce a finite field analogue…
Given a connected outerplanar graph G of pathwidth p, we give an algorithm to add edges to G to get a supergraph of G, which is 2-vertex-connected, outerplanar and of pathwidth O(p). This settles an open problem raised by Biedl, in the…
We introduce a new method to generate duality relations for correlation functions of the Potts model on planar graphs. The method extends previously known results, by allowing the consideration of the correlation function for arbitrarily…
In this paper, we study planar drawings of maximal outerplanar graphs with the objective of achieving small height. A recent paper gave an algorithm for such drawings that is within a factor of 4 of the optimum height. In this paper, we…
We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…
We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that remove a single vertex. Moreover, we give a cubic time…
Given a connected undirected multigraph G (a graph that may contain parallel edges), the algorithm of [19] finds the 3-edge-connected components of $G$ in linear time using an innovative graph contraction technique based on a depth-first…