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

Given an $n$-vertex non-negatively real-weighted graph $G$, whose vertices are partitioned into a set of $k$ clusters, a \emph{clustered network design problem} on $G$ consists of solving a given network design optimization problem on $G$,…

We introduce an algorithmic framework to investigate spherical and geodesic growth series of braid groups relatively to the Artin's or Birman-Ko-Lee's generators. We present our experimentations in the case of three and four strands and…

We construct a new spectral sequence beginning at the Khovanov homology of a link and converging to the Khovanov homology of the disjoint union of its components. The page at which the sequence collapses gives a lower bound on the splitting…

We develop a framework for computing the homology of weighted simplicial complexes with coefficients in a discrete valuation ring. A weighted simplicial complex, $(X,v)$, introduced by Dawson [Cah. Topol. G\'{e}om. Diff\'{e}r. Cat\'{e}g. 31…

We show a spectral sequence for the rational Khovanov homology of an oriented link in terms of the rational Khovanov complexes and homologies of the link surgeries along an admissible cut. As a non trivial corollary, we give an explicit…

We lift the characteristic-2 totally twisted Khovanov homology of Roberts and Jaeger to a theory with integer coefficients. The result is a complex computing reduced odd Khovanov homology for knots. This complex is equivalent to a…

We prove that the hypothetical extreme Khovanov cohomology of a link is the cohomology of the independence simplicial complex of its Lando graph. We also provide a family of knots having as many non-trivial extreme Khovanov cohomology…

We show that the Artin representation on concordance classes of string links induces a well-defined epimorphism modulo order n twisted Whitney tower concordance, and that the kernel of this map is generated by band sums of iterated…

In this paper we introduce a chain complex $C_{1 \pm 1}(D)$ where D is a plat braid diagram for a knot K. This complex is inspired by knot Floer homology, but it the construction is purely algebraic. It is constructed as an oriented cube of…

The (untwisted) oriented cube of resolutions for knot Floer homology assigns a complex $C_{F}(S)$ to a singular resolution $S$ of a knot $K$. Manolescu conjectured that when $S$ is in braid position, the homology $H_{*}(C_{F}(S))$ is…

We compute explicitly the Khovanov polynomials (using the computer program from katlas.org) for the two simplest families of the satellite knots, which are the twisted Whitehead doubles and the two-strand cables. We find that a quantum…

In this paper we define an explicit basis for the $\mathfrak{gl}_n$-web algebra $H_n(\vec{k})$ (the $\mathfrak{gl}_n$ generalization of Khovanov's arc algebra) using categorified $q$-skew Howe duality. Our construction is a…

Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…

We study the problem of finding a temporal hybridization network for a set of phylogenetic trees that minimizes the number of reticulations. First, we introduce an FPT algorithm for this problem on an arbitrary set of $m$ binary trees with…

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…

In a complete graph $K_n$ with edge weights drawn independently from a uniform distribution $U(0,1)$ (or alternatively an exponential distribution $\operatorname{Exp}(1)$), let $T_1$ be the MST (the spanning tree of minimum weight) and let…

Let F be a finite family of graphs. In the F-Deletion problem, one is given a graph G and an integer k, and the goal is to find k vertices whose deletion results in a graph with no minor from the family F. This may be regarded as a…

We explore the algebraic structure of the solution space of convex optimization problem Constrained Minimum Trace Factor Analysis (CMTFA), when the population covariance matrix $\Sigma_x$ has an additional latent graphical constraint,…

For a family of graphs $\mathcal{F}$, Weighted $\mathcal{F}$-Deletion is the problem for which the input is a vertex weighted graph $G=(V,E)$ and the goal is to delete $S\subseteq V$ with minimum weight such that $G\setminus…

We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the…