Related papers: Groebner-Shirshov basis for the braid semigroup
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…
In this survey, we formulate the Gr\"{o}bner-Shirshov bases theory for associative algebras and Lie algebras. Some new Composition-Diamond lemmas and applications are mentioned.
In this paper, we compute the Gr\"obner-Shirshov bases for certain regular double extension algebras by means of an algorithm implemented in Matlab, which facilitates the underlying algebraic computations. Moreover, we establish that these…
In this paper, we define the Gr\"obner-Shirshov basis for a dialgebra. The Composition-Diamond lemma for dialgebras is given then. As results, we give Gr\"obner-Shirshov bases for the universal enveloping algebra of a Leibniz algebra, the…
We first construct a linear basis for a free metabelian Poisson algebra generated by an arbitrary well-ordered set. It turns out that such a linear basis depends on the characteristic of the underlying field. Then we elaborate the method of…
In this paper, we establish the Gr\"{o}bner-Shirshov bases theory for metabelian Lie algebras. As applications, we find the Gr\"{o}bner-Shirshov bases for partial commutative metabelian Lie algebras related to circuits, trees and some…
We give Gr\"obner-Shirshov bases for Drinfeld-Kohno Lie algebra $\textbf{L}_{n}$ in \cite{[Et]} and Kukin Lie algebra $A_P$ in \cite{Kukin}, where $P$ is a semigroup. As applications, we show that as $\mathbb{Z}$-module $\textbf{L}_{n}$ is…
We establish Gr\"obner--Shirshov bases theory for commutative dialgebras. We show that for any ideal $I$ of $Di[X]$, $I$ has a unique reduced Gr\"obner--Shirshov basis, where $Di[X]$ is the free commutative dialgebra generated by a set $X$,…
In this paper, we elaborate Gr\"obner-Shirshov bases method for Leibniz (super)algebras. We show that there is a unique reduced Gr\"obner-Shirshov basis for every (graded) ideal of a free Leibniz (super)algebra. As applications, we…
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
We give a solution to the word problem for the singular braid monoid SB_n. The complexity of the algorithm is quadratic in the product of the word length and the number of the singular generators in the word. Furthermore we algebraically…
In this paper, linear bases for the partially commutative Lie algebras are found. The method of the Gr\"{o}bner--Shirshov bases is used. It easily follows from the structure that the equality problem is algorithmically solvable for the…
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of this paper is to elucidate this relationship, showing that…
In this paper, we review Shirshov's method for free Lie algebras invented by him in 1962 which is now called the Groebner-Shirshov bases theory.
Algebraic cryptanalysis usually requires to recover the secret key by solving polynomial equations. Grobner bases algorithm is a well-known method to solve this problem. However, a serious drawback exists in the Grobner bases based…
A finite Grobner-Shirshov basis is constructed for the plactic algebra of rank 3 over a field K. It is also shown that plactic algebras of rank exceeding 3 do not have finite Grobner-Shirshov bases associated to the natural…
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…
In this survey article, we report some new results of Groebner-Shirshov bases, including new Composition-Diamond lemmas, applications of some known Composition-Diamond lemmas and content of some expository papers.
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…
The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…