相关论文: A whittled complex for the Khovanov homology of to…

Performing efficient inference on Bayesian Networks (BNs), with large numbers of densely connected variables is challenging. With exact inference methods, such as the Junction Tree algorithm, clustering complexity can grow exponentially…

Let $G=(V,E)$ be a bipartite graph embedded in a plane (or $n$-holed torus). Two subgraphs of $G$ differ by a {\it $Z$-transformation} if their symmetric difference consists of the boundary edges of a single face---and if each subgraph…

We describe an iterable construction of THH for an E_n ring spectrum. The reduced version is an iterable bar construction and its n-th iterate gives a model for the shifted cotangent complex at the augmentation, representing reduced…

We show that the order of torsion homology classes in Bar-Natan deformation of Khovanov homology is a lower bound for the unknotting number. We give examples of knots that this is a better lower bound than |s(K)/2|, where s(K) is the…

We consider a fragmentation of discrete trees where the internal vertices are deleted independently at a rate proportional to their degree. Informally, the associated cut-tree represents the genealogy of the nested connected components…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

Ribbon concordance gives a partial order on knot types, and applying a knot homology functor to a ribbon concordance gives an inclusion of the homologies. The question of the existence of global ribbon minima in each concordance class is a…

We show that over the binary field $\mathbb F_2$, the Bar-Natan perturbation of Khovanov homology splits as the direct sum of its two reduced theories, which we also prove are isomorphic. This extends Shumakovitch's analogous result for…

Motivated by the works of Krasner [arXiv:0801.4018] and Lobb [arXiv:1103.1412], we simplify the Khovanov-Rozansky chain complexes of open 2-braids. As an application, we show that, for a knot containing a "long" 2-braid, the sl(N) Rasmussen…

We introduce a new method for computing triply graded link homology, which is particularly well-adapted to torus links. Our main application is to the (n,n)-torus links, for which we give an exact answer for all n. In several cases, our…

We introduce a multi-parameter deformation of the triply-graded Khovanov--Rozansky homology of links colored by one-column Young diagrams, generalizing the "$y$-ified" link homology of Gorsky--Hogancamp and work of Cautis--Lauda--Sussan.…

Quantum Bruhat graph is a weighted directed graph on a finite Weyl group first defined by Brenti-Fomin-Postnikov. It encodes quantum Monk's rule and can be utilized to study the $3$-point Gromov-Witten invariants of the flag variety. In…

Almost a decade ago Vaughan Jones introduced a method to produce knots from elements of the Thompson groups $F$, which was later extended to the Brown-Thompson group $F_3$. In this article we define a way to produce permutations out of…

Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum $s$-$t$ cut, the minimum multiway cut, and the minimum $k$-way cut are some of the commonly…

We introduce new polynomial isotopy invariants for closed braids. They are constructed as polynomial valued {\em Gauss diagram 1-cocycles} evaluated on the full rotation of the closed braid $\hat \beta$ around the core of the corresponding…

This paper shows the weighted matching problem on general graphs can be solved in time $O(n(m + n\log n))$ for $n$ and $m$ the number of vertices and edges, respectively. This was previously known only for bipartite graphs. The crux is a…

We construct explicitly the Khovanov homology theory for virtual links with arbitrary coefficients by using the twisted coefficients method. This method also works for constructing Khovanov homology for ``non-oriented virtual knots'' in the…

A toric braid is a braid whose closure is a torus link in $\mathbb{R}^3$. Manturov generalized toric braids that is called quasitoric braids and showed that the subset of quasitoric braids in the classical braid group is a subgroup of the…

We give explicit matrix presentations of the Blanchfield pairing and certain twisted Blanchfield pairings of the $(m,n)$-torus knot $T(m,n)$. Our method uses a taut identity realizing a genus-two Heegaard splitting of the manifold…

We define a measure of "complexity" of a braid which is natural with respect to both an algebraic and a geometric point of view. Algebraically, we modify the standard notion of the length of a braid by introducing generators $\Delta\_{ij}$,…