Related papers: Colored HOMFLY polynomials as multiple sums over p…
Braids can be represented geometrically as curve diagrams. The geometric complexity of a braid is the minimal complexity of a curve diagram representing it. We introduce and study the corresponding notion of geometric generating function.…
We compute the contribution of all multiple covers of an isolated rigid embedded holomorphic annulus, stretching between Lagrangians, to the skein-valued count of open holomorphic curves in a Calabi-Yau 3-fold. The result agrees with the…
We study various specializations of the colored HOMFLY-PT polynomial. These specializations are used to show that the multivariable link invariants arising from a complex family of sl(m|n) super-modules previously defined by the authors…
We construct a quantum algorithm to approximate efficiently the colored Jones polynomial of the plat presentation of any oriented link L at a fixed root of unity q. Our construction is based on SU(2) Chern-Simons topological quantum field…
The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…
We generalize the colored Jones polynomial to $4$-valent graphs. This generalization is given as a sequence of invariants in which the first term is a one variable specialization of the Kauffman-Vogel polynomial. We use the invariant we…
Given graphs $G$ and $H$ and a positive integer $q$ say that $G$ is $q$-Ramsey for $H$, denoted $G\rightarrow (H)_q$, if every $q$-colouring of the edges of $G$ contains a monochromatic copy of $H$. The size-Ramsey number $\hat{r}(H)$ of a…
In this paper, we introduce a new method to prove the Lickorish-Millett type formulae for colored HOMFLY-PT polynomials of links.
We generalize R. Riley's study about parabolic representations of two bridge knot groups to the general knots in $S^3$. We utilize the parabolic quandle method for general knot diagrams and adopt symplectic quandle for better investigation,…
We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…
An ordered graph is a pair $\mathcal{G}=(G,\prec)$ where $G$ is a graph and $\prec$ is a total ordering of its vertices. The ordered Ramsey number $\overline{R}(\mathcal{G})$ is the minimum number $N$ such that every ordered complete graph…
By now it is well established that the quantum dimensions of descendants of the adjoint representation can be described in a universal form, independent of a particular family of simple Lie algebras. The Rosso-Jones formula then implies a…
The Links-Quivers Correspondence predicts that all the symmetric (or antisymmetric) colored HOMFLY-PT polynomials of a link can be recovered from a finite amount of data (a quiver) associated to the link. We give a new geometric proof of…
Given an integer base $b\geq 2$, a number $\rho\geq 1$ of colors, and a finite sequence $\Lambda=(\lambda_1,\ldots,\lambda_\rho)$ of positive integers, we introduce the concept of a $\Lambda$-restricted $\rho$-colored $b$-ary partition of…
A path in an edge-colored graph is called a monochromatic path if all edges of the path have a same color. We call $k$ paths $P_1,\cdots,P_k$ rainbow monochromatic paths if every $P_i$ is monochromatic and for any two $i\neq j$, $P_i$ and…
We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…
Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern-Simons theory, these invariants can be found from crossing and braiding matrices of…
Let H_1, ..., H_k be graphs. The multicolor Ramsey number r(H_1,...,H_k) is the minimum integer r such that in every edge-coloring of K_r by k colors, there is a monochromatic copy of H_i in color i for some 1 <= i <= k. In this paper, we…
We review a construction of a new class of algebraic curves, called super-A-polynomials, and their quantum generalizations. The super-A-polynomial is a two-parameter deformation of the A-polynomial known from knot theory or Chern-Simons…
We develop a diagrammatic formalism for calculating the Alexander polynomial of the closure of a braid as a state-sum. Our main tools are the Markov trace formulas for the HOMFLY-PT polynomial and Young's semi-normal representations of the…