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

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

We discuss a new perspective on Khovanov homology, using categorifications of tensor products. While in many ways more technically demanding than Khovanov's approach (and its extension by Bar-Natan), this has distinct advantage of directly…

Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…

Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with several classes implementing this interface. Graph nodes can be any hashable Python objects. Directed edges are…

We prove that the Khovanov-Lee complex of an oriented link, L, in a thickened annulus, A x I, has the structure of a bifiltered complex whose filtered chain homotopy type is an invariant of the isotopy class of L in A x I. Using ideas of…

Any positive word comprised of random sequence of tokens form a finite alphabet can be reduced (without change of length) using an appropriate size Braid group relationships. Surprisingly the Braid relations dramatically reduce the…

We produce an explicit description of the K-theory and K-homology of the pure braid group on $n$ strands. We describe the Baum--Connes correspondence between the generators of the left- and right-hand sides for $n=4$. Using functoriality of…

This paper develops a new chain model for the commutative graph complex $\mathsf{GC}_2$ which takes Lie graph homology as an input. Our main technical result is the identification of a large contractible complex of (certain) tadpoles and…

Connected clustering denotes a family of constrained clustering problems in which we are given a distance metric and an undirected connectivity graph $G$ that can be completely unrelated to the metric. The aim is to partition the $n$…

For each braided category $\mathcal{C}$ we show that, under mild hypotheses, there is an associated category of "half braided algebras" and their bimodules internal to $\mathcal{C}$ which is not only monoidal but even braided and balanced.…

In this paper we present a quantifier elimination method for conjunctions of linear real arithmetic constraints. Our algorithm is based on the Fourier-Motzkin variable elimination procedure, but by case splitting we are able to reduce the…

Let $\Delta$ be a trivial knot in the three-sphere. For every finite cyclic group $G$ of odd order, we construct a $G$-equivariant Khovanov homology with coefficients in the filed $\F_{2}$. This homology is an invariant of links up to…

We create a framework for odd Khovanov homology in the spirit of Bar-Natan's construction for the ordinary Khovanov homology. Namely, we express the cube of resolutions of a link diagram as a diagram in a certain 2-category of chronological…

We introduce a refinement of Bar-Natan homology for involutive links, extending the work of Lobb-Watson and Sano. We construct a new suite of numerical invariants and derive bounds for the genus of equivariant cobordisms between strongly…

Consider the edge-deletion process in which the edges of some finite tree T are removed one after the other in the uniform random order. Roughly speaking, the cut-tree then describes the genealogy of connected components appearing in this…

This thesis studies the Bar-Natan skein module of the solid torus with a particular boundary curve system, and in particular a diagrammatic presentation of it due to Russell. This module has deep connections to topology and…

We study the problem of finding generators for the fundamental group G of a space of the following sort: one removes a family of complex hyperplanes from n dimensional complex vector space, or n dimensional complex hyperbolic space, or the…

We introduce Khovanov homology for ribbon graphs and show that the Khovanov homology of a certain ribbon graph embedded on the Turaev surface of a link is isomorphic to the Khovanov homology of the link (after a grading shift). We also…

We construct combinatorial bases of the $T$-equivariant ($T$ is the maximal torus) cohomology $H^\bullet_T(\Sigma,k)$ of the Bott-Samelson variety $\Sigma$ under some mild restrictions on the field of coefficients $k$. This bases allow us…

We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins),…