相关论文: Fast Khovanov Homology Computations
We determine the structure of the Khovanov homology groups in homological grading 1 of positive links. More concretely, we show that the first Khovanov homology is supported in a single quantum grading determined by the Seifert genus of the…
An algorithmic proof of General Neron Desingularization is given here for one dimensional local domains and it is implemented in \textsc{Singular}. Also a theorem recalling Greenberg' strong approximation theorem is presented for one…
Let $G$ be a simply connected solvable Lie group with a lattice $\Gamma$ and $N$ the nilradical of $G$. For a complex valued representation $\rho: G\to GL(V_{\rho})$ such that the restriction $\rho_{|_{N}}$ is unipotent, as an advanced…
We present a new, deterministic, distributed MAP estimation algorithm for Markov Random Fields called Local Highest Confidence First (Local HCF). The algorithm has been applied to segmentation problems in computer vision and its performance…
We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…
In this paper we reconsider the original Kolmogorov normal form algorithm with a variation on the handling of the frequencies. At difference with respect to the Kolmogorov approach, we do not keep the frequencies fixed along the…
We construct an equivariant version of annular Khovanov homology via the Frobenius algebra associated with $U(1) \times U(1)$-equivariant cohomology of $\mathbb{CP}^1$. Motivated by the relationship between the Temperley-Lieb algebra and…
We extend the covering of even and odd Khovanov link homology to tangles, using arc algebras. For this, we develop the theory of quasi-associative algebras and bimodules graded over a category with a 3-cocycle. Furthermore, we show that a…
Computations in the cohomology of finite groups.
We conjecture a relation between the sl(N) knot homology, recently introduced by Khovanov and Rozansky, and the spectrum of BPS states captured by open topological strings. This conjecture leads to new regularities among the sl(N) knot…
In this paper, we propose a simple but effective method for fast image segmentation. We re-examine the locality-preserving character of spectral clustering by constructing a graph over image regions with both global and local connections.…
A Kernel Adaptive Metropolis-Hastings algorithm is introduced, for the purpose of sampling from a target distribution with strongly nonlinear support. The algorithm embeds the trajectory of the Markov chain into a reproducing kernel Hilbert…
We describe a strategy for constructing reduced Khovanov homology for links in lens spaces by generalizing a symplectic interpretation of reduced Khovanov homology for links in $S^3$ due to Hedden, Herald, Hogancamp, and Kirk. The strategy…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
We present an efficient algorithm for one- and two-component relativistic exact-decoupling calculations. Spin-orbit coupling is thus taken into account for the evaluation of relativistically transformed (one-electron) Hamiltonian. As the…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…
This paper is concerned with nanowords, a generalization of links, introduced by Turaev. It is shown that the system of bigraded homology groups is an invariant of nanowords by introducing a new notion. This paper gives two examples which…
We propose an efficient algorithm for computing a common eigenvector of a finite set of square matrices. As an immediate consequence we obtain an algorithm for determining whether the matrices admit a simultaneous triangulation, and, if so,…
Within the context of topological data analysis, the problems of identifying topological significance and matching signals across datasets are important and useful inferential tasks in many applications. The limitation of existing solutions…