Related papers: Matrix factorizations and colored MOY graphs
We provide the first complete computations of colored sl(N) homology for a nontrivial knot. In doing so, we show that the colored sl(N) homology of the trefoil labeled by an exterior power of the defining representation is isomorphic to the…
This paper has been divided into three papers. arXiv:0809.3232, arXiv:0808.4134, arXiv:cs/0607105
We say that a link $L_1$ is an s-major of a link $L_2$ if any diagram of $L_1$ can be transformed into a diagram of $L_2$ by changing some crossings and smoothing some crossings. This relation is a partial ordering on the set of all prime…
We introduce the partition function of edge-colored graph homomorphisms, of which the usual partition function of graph homomorphisms is a specialization, and present an efficient algorithm to approximate it in a certain domain. Corollaries…
We study the problem of computing the homology of the configuration spaces of a finite cell complex $X$. We proceed by viewing $X$, together with its subdivisions, as a subdivisional space--a kind of diagram object in a category of cell…
We describe some of the algebra underlying the decomposition of planar grid diagrams. This provides a useful toy model for an extension of Heegaard Floer homology to 3-manifolds with parametrized boundary. This paper is meant to serve as a…
We continue the study of quantum A-polynomials -- equations for knot polynomials with respect to their coloring (representation-dependence) -- as the relations between different links, obtained by hanging additional ``simple'' components on…
We construct a graph G such that any embedding of G into R^{3} contains a nonsplit link of two components, where at least one of the components is a nontrivial knot. Further, for any m < n we produce a graph H so that every embedding of H…
This paper is a brief overview of recent results by the authors relating colored Jones polynomials to geometric topology. The proofs of these results appear in the papers [arXiv:1002.0256] and [arXiv:1108.3370], while this survey focuses on…
We define a family of formal Khovanov brackets of a colored link depending on two parameters. The isomorphism classes of these brackets are invariants of framed colored links. The Bar-Natan functors applied to these brackets produce…
This supplementary material includes three parts: some preliminary results, four examples, an experiment, three new algorithms, and all proofs of the results in the paper "Reversible MCMC on Markov equivalence classes of sparse directed…
Multi-document summarization is a process of automatic generation of a compressed version of the given collection of documents. Recently, the graph-based models and ranking algorithms have been actively investigated by the extractive…
The first two sections of the paper provide a convenient scheme and additional diagrammatics for working with Frobenius extensions responsible for key flavors of equivariant SL(2) link homology theories. The goal is to clarify some basic…
A connected matching in a graph $G$ is a matching contained in a connected component of $G$. A well-known method due to {\L}uczak reduces problems about monochromatic paths and cycles in complete graphs to problems about monochromatic…
We study open book foliations on surfaces in 3-manifolds, and give applications to contact geometry of dimension 3. We prove a braid-theoretic formula of the self-linking number of transverse links, which reveals an unexpected link to the…
This note discusses an interesting matrix factorization called the CUR Decomposition. We illustrate various viewpoints of this method by comparing and contrasting them in different situations. Additionally, we offer a new characterization…
The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of colors so that adjacent vertices have different colors. In…
We define a Floer-homology invariant for links in $S^3$, and study its properties.
This is the author's diploma thesis. We describe a simplification in the construction of Khovanov-Rozansky's categorification of quantum sl(n) link homology using the theory of maximal Cohen-Macaulay modules over hypersurface singularities…
Resolving a problem raised by Norin, we show that for each $k \in \mathbb{N}$, there exists an $f(k) \le 7k$ such that every graph $G$ with chromatic number at least $f(k)+1$ contains a subgraph $H$ with both connectivity and chromatic…