Related papers: Colored Morton-Franks-Williams inequalities
Let G be a chordal graph, X(G) the complement of the associated complex arrangement and Gamma(G) the fundamental group of X(G). We show that Gamma(G) is a limit of colored braid groups over the poset of simplices of G. When G = G_T is the…
We show that multivariable colored link invariants are derived from the roots of unity representations of $U_q(g)$. We propose a property of the Clebsch-Gordan coefficients of $U_q(g)$, which is important for defining the invariants of…
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 continue the program of systematic study of extended HOMFLY polynomials. Extended polynomials depend on infinitely many time variables, are close relatives of integrable tau-functions, and depend on the choice of the braid representation…
We use a graph-theoretic approach which yields improvements on the known Gilbert-Varshamov (GV) bound for sum-rank-metric codes for certain parameters. In particular, we show that asymptotically $\mathbb{F}_q^{\mathbf{n} \times \mathbf{m}}$…
We show that there are only finitely many homogeneous links whose Conway polynomial has any given degree. Using this we give an example of an inhomogeneous, fibred knot. Secondly, we show how to compute the monodromy of a homogeneous link…
We prove two distinct and natural refinements of a recent breakthrough result of Molloy (and a follow-up work of Bernshteyn) on the (list) chromatic number of triangle-free graphs. In both our results, we permit the amount of colour made…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We study the asymptotic expansion of the colored Jones polynomial (the Melvin-Morton expansion) using a recursion formula for the deframed universal weight system for the $sl(2)$ Lie algebra. Combined with the formula for the universal…
The colored HOMFLY polynomial is the quantum invariant of oriented links in $S^3$ associated with irreducible representations of the quantum group $U_q(\mathrm{sl}_N)$. In this paper, using an approach to calculate quantum invariants of…
Proper vertex colorings of a graph are related to its boundary map, also called its signed vertex-edge incidence matrix. The vertex Laplacian of a graph, a natural extension of the boundary map, leads us to introduce nowhere-harmonic…
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…
Murakami-Ohtsuki-Yamada introduced an evaluation of certain oriented planar trivalent graphs with colored edges. This evaluation plays a key role in the evaluation of the colored HOMFLY polynomial of a link in 3-space and its…
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…
This paper proves limit theorems for the number of monochromatic edges in uniform random colorings of general random graphs. These can be seen as generalizations of the birthday problem (what is the chance that there are two friends with…
We use categorical annular evaluation to give a uniform construction of both $\mathfrak{sl}_n$ and HOMFLYPT Khovanov-Rozansky link homology, as well as annular versions of these theories. Variations on our construction yield…
We prove that for a line perfect multigraph the chromatic index is equal to the list chromatic index. This is a generalization of Galvin's result on bipartite multigraphs. Soon after the first version was submitted to arxiv, I found out…
The color refinement algorithm is mainly known as a heuristic method for graph isomorphism testing. It has surprising but natural characterizations in terms of, for example, homomorphism counts from trees and solutions to a system of linear…
The Reshetikhin-Turaev sl(N) polynomial of links colored by wedge powers of the defining representation has been categorified via several different approaches. Here, we give a concise introduction to the categorification using matrix…
We generalize Brooks's theorem to show that if $G$ is a Borel graph on a standard Borel space $X$ of degree bounded by $d \geq 3$ which contains no $(d+1)$-cliques, then $G$ admits a $\mu$-measurable $d$-coloring with respect to any Borel…