相关论文: Efficient solutions to the braid isotopy problem

We show a simple and easily implementable solution to the word problem for virtual braid groups.

We extend our recent work on set-theoretic solutions of the Yang-Baxter or braid relations with new results about their automorphism groups, strong twisted unions of solutions and multipermutation solutions. We introduce and study graphs of…

In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…

In this paper we develop a procedure to deal with a family of parameter-dependent ill-posed problems, for which the exact solution in general does not exist. The original problems are relaxed by considering corresponding approximate ones,…

We give a simpler proof using automata theory of a recent result of Kapovich, Weidmann and Myasnikov according to which so-called benign graphs of groups preserve decidability of the generalized word problem. These include graphs of groups…

In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…

The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, states that any two almost optimal graphs of the same order $n$…

We describe an alternative way of computing Alexander polynomials of knots/links, based on the Artin representation of the corresponding braids by automorphisms of a free group. Then we apply the same method to other representations of…

Three algorithms of Gram-Schmidt type are given that produce an orthogonal decomposition of finite $d$-dimensional symmetric, alternating, or Hermitian forms over division rings. The first uses $d^3/3+O(d^2)$ ring operations with very…

We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…

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.

In a recent paper by L. A. Bokut, V. V. Chaynikov and K. P. Shum in 2007, Braid group $B_n$ is represented by Artin-Burau's relations. For such a representation, it is told that all other compositions can be checked in the same way. In this…

We consider anti-unification for simply typed lambda terms in associative, commutative, and associative-commutative theories and develop a sound and complete algorithm which takes two lambda terms and computes their generalizations in the…

We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…

A result of Allock [1](arXiv:math/9907194) states that certain orbifold braid groups contain Artin groups of type $D_n$, $\tilde{B}_n$ and $\tilde{D}_n$ as finite index subgroups. The underlying orbifolds have at most two cone points of…

We obtain an R-matrix or matrix representation of the Artin braid group acting in a canonical way on the vector space of every (super)-Lie algebra or braided-Lie algebra. The same result applies for every (super)-Hopf algebra or…

In this manuscript we propose and analyze an implicit two-point type method (or inertial method) for obtaining stable approximate solutions to linear ill-posed operator equations. The method is based on the iterated Tikhonov (iT) scheme. We…

There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a method developed by…

Braid theory is used to calcualte the topological entropy of data from the belousov-Zhabotinskii reaction, the results agree well with one-dimensional theory to the order of approximation considered.

The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…