Related papers: Cabling procedure for the colored HOMFLY polynomia…
In quantum information and communication, optical schemes provide simple and intuitive experimental implementations. Of particular importance is quantum state preparation. In this thesis, the creation of polarisation entanglement using a…
Besides offering a friendly introduction to knot homologies and quantum curves, the goal of these lectures is to review some of the concrete predictions that follow from the physical interpretation of knot homologies. In particular, this…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
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 study a reconstruction problem for colorings. Given a finite or countable set $X$, a coloring on $X$ is a function $\varphi: [X]^{2}\to \{0,1\}$, where $[X]^{2}$ is the collection of all 2-elements subsets of $X$. A set $H\subseteq X$ is…
We give a geometric construction of the multivariable Conway potential function for colored links. In the case of a single color, it is Kauffman's definition of the Conway polynomial in terms of a Seifert matrix.
M. Khovanov and L. Rozansky gave a categorification of the HOMFLY-PT polynomial. This study is a generalization of the Khovanov-Rozansky homology. We define a homology associated to the quantum $(sl_n,\land V_n)$ link invariant, where…
We conjecture an expression for the dimensions of the Khovanov-Rozansky HOMFLY homology groups of the link of a plane curve singularity in terms of the weight polynomials of Hilbert schemes of points scheme-theoretically supported on the…
We split the crossings of the foil knot and enumerate the resulting states with a generating polynomial. Unexpectedly, the number of such states which consist of two components are given by the lazy caterer's sequence. This sequence…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
Inspired by recent advances in the chromosome capture techniques, a method is proposed to study the structural organization of systems of polymers rings with topological constraints.To this purpose, the system is divided into compartments…
Obtaining a closed-form expression for the colored HOMFLY-PT polynomials of knots from $3$-strand braids carrying arbitrary $SU(N)$ representation is a challenging problem. In this paper, we confine our interest to twisted generalized…
We study the graph coloring problem over random graphs of finite average connectivity $c$. Given a number $q$ of available colors, we find that graphs with low connectivity admit almost always a proper coloring whereas graphs with high…
In this paper, we consider categories with colored morphisms and functors such that morphisms assigned to morphisms with a common color have a common color. In this paper, we construct a morphism-colored functor such that any…
In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored…
We rewrite the (extended) Ooguri-Vafa partition function for colored HOMFLY-PT polynomials for torus knots in terms of the free-fermion (semi-infinite wedge) formalism, making it very similar to the generating function for double Hurwitz…
In the \probrFix problem, we are given a graph $G$, a (non-proper) vertex-coloring $c : V(G) \to [r]$, and a positive integer $k$. The goal is to decide whether a proper $r$-coloring $c'$ is obtainable from $c$ by recoloring at most $k$…
In this paper we study $U(N)$ colored HOMFLY-PT polynomials of torus links in the double scaling limit (polynomial variable $q\rightarrow 1$, $N\rightarrow \infty$ keeping $q^N$ fixed). We show that, in this limit, the colored HOMFLY-PT…
An averaged generating function for coloured hard-dimers is being investigated by proving estimates for the latter. Furthermore, two different enumerating problems and their distributions are studied numerically.
A ring is a graph $R$ whose vertex set can be partitioned into $k \geq 4$ nonempty sets, $X_1, \dots, X_k$, such that for all $i \in \{1,\dots,k\}$, the set $X_i$ can be ordered as $X_i = \{u_i^1, \dots, u_i^{|X_i|}\}$ so that $X_i…