Related papers: Matrix factorizations and colored MOY graphs
We present a short proof of the following Pontryagin theorem, whose original proof was complicated and has never been published in details: {\bf Theorem.} Let $M$ be a connected oriented closed smooth 3-manifold. Let $L_1(M)$ be the set of…
We generalize overpartitions to (k,j)-colored partitions: k-colored partitions in which each part size may have at most j colors. We find numerous congruences and other symmetries. We use a wide array of tools to prove our theorems:…
We prove that the colored HOMFLY polynomial of a link, colored by symmetric or exterior powers of the fundamental representation, is q-holonomic with respect to the color parameters. As a result, we obtain the existence of an (a,q)…
Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a…
A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e., 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an…
Starting from the work by Jones on representations of Thompson's group $F$, subgroups of $F$ with interesting properties have been defined and studied. One of these subgroups is called the $3$-colorable subgroup $\mathcal{F}$, which…
Motivated by Khovanov homology and relations between the Jones polynomial and graph polynomials, we construct a homology theory for embedded graphs from which the chromatic polynomial can be recovered as the Euler characteristic. For plane…
We prove that the foam and matrix factorization universal rational sl3 link homologies are naturally isomorphic as projective functors from the category of link and link cobordisms to the category of bigraded vector spaces.
In "Homfly polynomial via an invariant of colored plane graphs", Murakami, Ohtsuki, and Yamada provide a state-sum description of the level $n$ Jones polynomial of an oriented link in terms of a suitable braided monoidal category whose…
In this paper, we consider the problem of a star coloring. In general case the problems in NP-complete. We establish the star chromatic number for splitting graph of complete and complete bipartite graphs, as well of paths and cycles. Our…
We construct a pairing, which we call factorization homology, between framed manifolds and higher categories. The essential geometric notion is that of a vari-framing of a stratified manifold, which is a framing on each stratum together…
In this paper we describe all edge-colored graphs that are fully symmetric with respect to colors and transitive on every set of edges of the same color. They correspond to fully symmetric homogeneous factorizations of complete graphs. Our…
A method to obtain explicit and complete topological solution of SU(2) Chern-Simons theory on $S^3$ is developed. To this effect the necessary aspects of the theory of coloured-oriented braids and duality properties of conformal blocks for…
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…
This article gives a foundational account of various characterizations of framed links in the $3$-sphere.
We generalize results of Lee, Gornik and Wu on the structure of deformed colored sl(N) link homologies to the case of non-generic deformations. To this end, we use foam technology to give a completely combinatorial construction of Wu's…
Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…
Coloring the arcs of biregular graphs was introduced with possible applications to industrial chemistry, molecular biology, cellular neuroscience, etc. Here, we deal with arc coloring in some non-bipartite graphs. In fact, for…
A graph coloring has bounded clustering if each monochromatic component has bounded size. This paper studies such a coloring, where the number of colors depends on an excluded complete bipartite subgraph. This is a much weaker assumption…
A Fox p-colored knot $K$ in $S^3$ gives rise to a $p$-fold branched cover $M$ of $S^3$ along $K$. The pre-image of the knot $K$ under the covering map is a $\dfrac{p+1}{2}$-component link $L$ in $M$, and the set of pairwise linking numbers…