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

We prove that an arbitrary right-angled Artin group $G$ admits a quasi-isometric group embedding into a right-angled Artin group defined by the opposite graph of a tree. Consequently, $G$ admits quasi-isometric group embeddings into a pure…

In this paper, we obtain Groebner-Shirshov (non-commutative Gr\"obner) bases for the braid groups in the Birman-Ko-Lee generators enriched by new ``Garside word" $\delta$. It gives a new algorithm for getting the Birman-Ko-Lee Normal Form…

We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks:…

In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…

This article is about Artin's braid group and its role in knot theory. We set ourselves two goals: (i) to provide enough of the essential background so that our review would be accessible to graduate students, and (ii) to focus on those…

In this article, we present a family of numerical approaches to solve high-dimensional linear non-symmetric problems. The principle of these methods is to approximate a function which depends on a large number of variates by a sum of tensor…

This article is a survey on the braid groups, the Artin groups, and the Garside groups. It is a presentation, accessible to non-experts, of various topological and algebraic aspects of these groups. It is also a report on three points of…

This paper aims to determine the images of the braid group under representations afforded by the Yang Baxter equation when the solution is a nontrivial $4 \times 4$ matrix. Making the assumption that all the eigenvalues of the Yang Baxter…

We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…

We propose modification of Markovsky crypto-algorithm [2, 3, 4] on n-ary groupoids [1] that are invertible on at least one place.

In this paper, we propose the greedy and random Broyden's method for solving nonlinear equations. Specifically, the greedy method greedily selects the direction to maximize a certain measure of progress for approximating the current…

The paper deals with the problem of existence of a convergent "strong" normal form in the neighbourhood of an equilibrium, for a finite dimensional system of differential equations with analytic and time-dependent non-linear term. The…

A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…

In graph theory, the longest path problem is the problem of finding a simple path of maximum length in a given graph. For some small classes of graphs, the problem can be solved in polynomial time [2, 4], but it remains NP-hard on general…

Several modern applications involve huge graphs and require fast answers to reachability queries. In more than two decades since first proposals, several approaches have been presented adopting on-line searches, hop labelling or transitive…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

Whereas there are simple algorithms that are proven to be optimal for the Classical and the Multiple Choice Secretary Problem, the Matroid Secretary Problem is less thoroughly understood. This paper proposes the generalization of some…

In axisymmetric fusion reactors, the equilibrium magnetic configuration can be expressed in terms of the solution to a semi-linear elliptic equation known as the Grad-Shafranov equation, the solution of which determines the poloidal…

Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…

The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…