相关论文: Fast Khovanov Homology Computations

We investigate the problem of "nonlocal" computation, in which separated parties must compute a function with nonlocally encoded inputs and output, such that each party individually learns nothing, yet together they compute the correct…

We investigate Bar-Natan's characteristic two Khovanov link homology theory studying both the filtered and bi-graded theories. The filtered theory is computed explicitly and the bi-graded theory analysed by setting up a family of spectral…

Bipartite calculus is a direct generalization of Kauffman planar expansion from $N=2$ to arbitrary $N$, applicable to the restricted class of knots which are entirely made of antiparallel lock tangles. Whenever applicable, it allows a…

Quantum Hamiltonian complexity studies computational complexity aspects of local Hamiltonians and ground states; these questions can be viewed as generalizations of classical computational complexity problems related to local constraint…

We construct a spectral sequence relating the Khovanov homology of a strongly invertible knot to the annular Khovanov homologies of the two natural quotient knots. Using this spectral sequence, we re-prove that Khovanov homology…

We use Khovanov homology to define families of LDPC quantum error-correcting codes: unknot codes with asymptotical parameters [[3^(2l+1)/sqrt(8{\pi}l);1;2^l]]; unlink codes with asymptotical parameters [[sqrt(2/2{\pi}l)6^l;2^l;2^l]] and…

Persistent homology is a popular and powerful tool for capturing topological features of data. Advances in algorithms for computing persistent homology have reduced the computation time drastically -- as long as the algorithm does not…

Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…

In this paper we shall describe some correlation function computations in perturbative heterotic strings that, for example, in certain circumstances can lend themselves to a heterotic generalization of quantum cohomology calculations.…

We explicitly compute the Dolbeault cohomologies of certain domains in complex space generalizing the classical Hartogs figure. The cohomology groups are non-Hausdorff topological vector spaces, and it is possible to identify the reduced…

This paper begins with a survey of some applications of Khovanov homology to low-dimensional topology, with an eye toward extending these results to $\mathfrak{sl}(n)$ homologies. We extend Levine and Zemke's ribbon concordance obstruction…

In this paper, we show that contraction operations preserve the homology of $n$D generalized maps, under some conditions. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of $n$D…

A very classical subject in Commutative Algebra is the Invariant Theory of finite groups. In our work on 3-dimensional topology (S. King, Ideal Turaev-Viro invariants. To appear in Top. Appl.), we found certain examples of group actions on…

We define and study equivariant analytic and local cyclic homology for smooth actions of totally disconnected groups on bornological algebras. Our approach contains equivariant entire cyclic cohomology in the sense of Klimek, Kondracki and…

We study tangle replacement in the context of spatial graphs. The main results show that, for certain spatial handcuff graphs, there is a one-to-one correspondence between the neighborhood equivalence classes of the spatial graphs obtained…

A powerful approach to computing Feynman integrals or cosmological correlators is to consider them as solution to systems of differential equations. Often these can be chosen to be Gelfand-Kapranov-Zelevinsky (GKZ) systems. However, their…

Algorithms for community detection are usually stochastic, leading to different partitions for different choices of random seeds. Consensus clustering has proven to be an effective technique to derive more stable and accurate partitions…

Szab\'o recently introduced a combinatorially-defined spectral sequence in Khovanov homology. After reviewing its construction and explaining our methodology for computing it, we present results of computations of the spectral sequence.…

Persistent homology is a technique recently developed in algebraic and computational topology well-suited to analysing structure in complex, high-dimensional data. In this paper, we exposit the theory of persistent homology from first…

We give an algorithm to compute the following cohomology groups on $U = \C^n \setminus V(f)$ for any non-zero polynomial $f \in \Q[x_1, ..., x_n]$; 1. $H^k(U, \C_U)$, $\C_U$ is the constant sheaf on $U$ with stalk $\C$. 2. $H^k(U, \Vsc)$,…