Related papers: Groebner-Shirshov basis for the braid semigroup
Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…
We study a question which can be roughly stated as follows: Given a (unital or nonunital) algebra $A$ together with a Gr\"obner-Shirshov basis $G$, consider the free operated algebra $B$ over $A$, such that the operator satisfies some…
We construct a new bounded functional calculus for the generators of bounded semigroups on Hilbert spaces and generators of bounded holomorphic semigroups on Banach spaces. The calculus is a natural (and strict) extension of the classical…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
In this paper, we study the averaging operator by assigning a rewriting system to it. We obtain some basic results on the kind of rewriting system we used. In particular, we obtain a sufficient and necessary condition for the confluence. We…
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.
Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…
Braid combing is a procedure defined by Emil Artin to solve the word problem in braid groups for the first time. It is well-known to have exponential complexity. In this paper, we use the theory of straight line programs to give a…
We present foundational work on standard bases over rings and on Boolean Groebner bases in the framework of Boolean functions. The research was motivated by our collaboration with electrical engineers and computer scientists on problems…
In this survey article, we report some new results of Gr\"obner-Shirshov bases, including new Composition-Diamond lemmas and some applications of some known Composition-Diamond lemmas.
Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…
The purpose of this paper is to revisit the proof of the Gearhart-Pr\"uss-Huang-Greiner theorem for a semigroup $S(t)$, following the general idea of the proofs that we have seen in the literature and to get an explicit estimate on the…
For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…
A numerical semigroup $M$ is a subset of the non-negative integers that is closed under addition. A factorization of $n \in M$ is an expression of $n$ as a sum of generators of $M$, and the Graver basis of $M$ is a collection $Gr(M_t)$ of…
We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…
The congruence subgroups of braid groups arise from a congruence condition on the integral Burau representation $B_n \to \operatorname{GL}_{n}(\mathbb Z)$. We find the image of such congruence subgroups in $\operatorname{GL}_{n}(\mathbb…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
This paper describes a Buchberger-style algorithm to compute a Groebner basis of a polynomial ideal, allowing for a selection strategy based on "signatures". We explain how three recent algorithms can be viewed as different strategies for…
Let $G$ be a group endowed with a solution to the conjugacy problem and with an algorithm which computes the centralizer in $G$ of any element of $G$. Let $H$ be a subgroup of $G$. We give some conditions on $H$, under which we provide a…
In this paper we use the operadic framework to find Gr\"obner-Shirshov bases for the free quadri-algebra. We perform computations using the representation of the nonsymmetric operad by planar rooted trees in a very intuitive way.…