Related papers: Matrix factorizations and colored MOY graphs

In mathematical phylogenetics, evolutionary relationships are often represented by trees and networks. The latter are typically used whenever the relationships cannot be adequately described by a tree, which happens when so-called…

In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…

A graph multilink is a link with multiplicities in a homology 3-sphere whose exterior is a graph manifold. In this Note, we compute the Novikov homology of graph multilinks. As a corollary, we give a majoration for the number of Novikov…

To a presentation of an oriented link as the closure of a braid we assign a complex of bigraded vector spaces. The Euler characteristic of this complex (and of its triply-graded cohomology groups) is the HOMFLYPT polynomial of the link. We…

In this short article, we study factor colorings of aperiodic linearly recurrent infinite words. We show that there always exists a coloring which does not admit a monochromatic factorization of the word into factors of increasing lengths.

We extend the definition of the colored Jones polynomials to framed links and trivalent graphs in S^3 # k S^2 X S^1 using a state-sum formulation based on Turaev's shadows. Then, we prove that the natural extension of the Volume Conjecture…

We generalize the works of Lee [arXiv:math/0210213v3] and Gornik [arXiv:math/0402266v2] to construct a basis for generic deformations of the colored sl(N)-homology defined in [arXiv:1002.2662v1]. As applications, we construct non-degenerate…

In the first part of the Thesis, we reformulate the Murakami-Ohtsuki-Yamada state-sum description of the level n Jones polynomial of an oriented link in terms of a suitable braided monoidal category whose morphisms are Q[q, q-1] s-linear…

Stanley in his paper [Stanley, Richard P.: Acyclic orientations of graphs In: Discrete Mathematics 5 (1973), Nr. 2, S. 171-178.] provided interpretations of the chromatic polynomial when it is substituted with negative integers. Greene and…

This is a sequel to [arXiv:1708.09092v2]. For an oriented trivalent graph $G$ without source or sink embedded in $S^3$, we prove that the $\mathfrak{gl}(1| 1)$-Alexander polynomial $\underline{\Delta}(G, c)$ defined by Viro satisfies a…

We define a new way to evaluate MOY graphs. We prove that this new evaluation coincides with the classical evaluation by checking some skein relations. As a consequence, we prove a formula which relates the $\mathfrak{sl}_N$ and…

We define a deformation of our earlier link homologies for fundamental representations of sl_m. The deformed homology of a link is isomorphic to the deformed homology of the disjoint union of its components. Moreover, there exists a…

For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…

We introduce three spectral sequences which give some expressions of colored Jones polynomials. Each spectral sequence contains a Khovanov-type homology groups. Two of them are derived from a bicomplex of the colored Jones polynomial. The…

The present paper upgrades the logical model required to exploit materialized views over property graphs as intended in the seminal paper "A Join Operator for Property Graphs". Furthermore, we provide some computational complexity proofs…

We use the skein theory of $\mathfrak{sl}_3$-webs to study the properties of the quantum $\mathfrak{sl}_3$-link polynomial of positive links. We give explicit formulae for the three leading terms of the polynomial on positive links in terms…

In this paper, we present several new structures for the colored HOMFLY-PT invariants of framed links. First, we prove the strong integrality property for the normalized colored HOMFLY-PT invariants by purely using the HOMFLY-PT skein…

We study the number of ways of factoring elements in the complex reflection groups G(r,s,n) as products of reflections. We prove a result that compares factorization numbers in G(r,s,n) to those in the symmetric group on n letters, and we…

Let $G$ be a nonabelian, simple group with a nontrivial conjugacy class $C \subseteq G$. Let $K$ be a diagram of an oriented knot in $S^3$, thought of as computational input. We show that for each such $G$ and $C$, the problem of counting…

We examine ordered graphs, defined as graphs with linearly ordered vertices, from the perspective of homomorphisms (and colorings) and their complexities. We demonstrate the corresponding computational and parameterized complexities, along…