Related papers: Colored Morton-Franks-Williams inequalities
We provide methods to compute the colored HOMFLY polynomials of knots and links with symmetric representations based on the linear skein theory. By using diagrammatic calculations, several formulae for the colored HOMFLY polynomials are…
We study a colored generalization of the famous simple-switch Markov chain for sampling the set of graphs with a fixed degree sequence. Here we consider the space of graphs with colored vertices, in which we fix the degree sequence and…
By considering `coloured' braid group representation we have obtained a quantum group, which reduces to the standard $GL_q(2)$ and $GL_{p,q}(2)$ cases at some particular limits of the `colour' parameters. In spite of quite complicated…
We introduce Weyl n-algebras and show how their factorization homology may be used to define invariants of manifolds. In the appendix we heuristically explain why these invariants must be perturbative Chern-Simons invariants.
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…
In this paper, we introduce a class of graphs which we call average hereditary graphs. Many graphs that occur in the usual graph theory applications belong to this class of graphs. Many popular types of graphs fall under this class, such as…
In the cabling procedure for HOMFLY polynomials colored HOMFLY polynomials of a knot are obtained from ordinary HOMFLY of the cabled knot with extra twists added. Thus colored polynomials can be seen as relation between HOMFLYs of cabled…
We utilize relations between Khovanov and chromatic graph homology to determine extreme Khovanov groups and corresponding coefficients of the Jones polynomial. The extent to which chromatic homology and chromatic polynomial can be used to…
An edge-coloring of a connected graph $G$ is called a {\em monochromatic connection coloring} (MC-coloring for short) if any two vertices of $G$ are connected by a monochromatic path in $G$. For a connected graph $G$, the {\em monochromatic…
It is well known that the Blanchfield pairing of a knot can be expressed using Seifert matrices. In this paper, we compute the Blanchfield pairing of a colored link with non-zero Alexander polynomial. More precisely, we show that the…
We establish inequalities that constrain the genera of smooth cobordisms between knots in 4-dimensional cobordisms. These "relative adjunction inequalities" improve the adjunction inequalities for closed surfaces which have been…
A classical problem, due to Gerencs\'er and Gy\'arf\'as from 1967, asks how large a monochromatic connected component can we guarantee in any $r$-edge colouring of $K_n$? We consider how big a connected component can we guarantee in any…
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…
The well-known Loday-Quillen-Tsygan theorem calculates the Lie algebra homology of the infinite general linear Lie algebra $\mathfrak{gl}(A)$ over an unital associative algebra $A$. We generalize the Loday-Quillen-Tsygan theorem to an…
We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and…
In this thesis we work with Khovanov homology of links and its generalizations, as well as with the homology of graphs. Khovanov homology of links consists of graded chain complexes which are link invariants, up to chain homotopy, with…
We prove that every graph with circumference at most $k$ is $O(\log k)$-colourable such that every monochromatic component has size at most $O(k)$. The $O(\log k)$ bound on the number of colours is best possible, even in the setting of…
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various…
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…
Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph $G$ is either $\Delta(G)+1$ or $\Delta(G)+2$, where $\Delta(G)$ is the largest degree of any vertex…