Related papers: Word problem for finitely presented metabelian Poi…
We establish Gr\"{o}bner-Shirshov bases theory for Gelfand-Dorfman-Novikov algebras over a field of characteristic $0$. As applications, a PBW type theorem in Shirshov form is given and we provide an algorithm for solving the word problem…
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…
We establish a universal approach to solution of the word problem in the varieties of di- and tri-algebras. This approach, for example, allows to apply Groebner---Shirshov bases method for Lie algebras to solve the ideal membership problem…
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 study the relation between Poisson algebras and representations of Lie conformal algebras. We establish a setting for the calculation of a Gr\"obner--Shirshov basis in a module over an associative conformal algebra and apply this…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
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…
We describe a solution of the word problem in free fields (coming from non-commutative polynomials over a commutative field) using elementary linear algebra, provided that the elements are given by minimal linear representations. It relies…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
In this paper, we generalize the Lyndon-Shirshov words to Lyndon-Shirshov $\Omega$-words on a set $X$ and prove that the set of all non-associative Lyndon-Shirshov $\Omega$-words forms a linear basis of the free Lie $\Omega$-algebra on the…
In this paper, we consider free transposed Poisson algebra and free F-manifold algebra with an additional metabelian identity. We construct a linear basis for both free metabelian transposed Poisson algebra and free metabelian F-manifold…
In this paper, we give a Gr\"obner-Shirshov basis for the finitely presented semigroup algebra $\mathbf{k}[S_n(Sym_n)]$ defined by permutation relations of symmetric type. As an application, by the Composition-Diamond Lemma, we obtain…
We show that the Word Problem in finitely generated subgroups of $\textsf{GL}_d(\mathbb{Z})$ can be solved in linear average-case complexity. This is done under the bit-complexity model, which accounts for the fact that large integers are…
We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…
In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…
We give a ranker-based description using finite-index congruences for the variety $\boldsymbol{\mathrm{DAb}}$ of finite monoids whose regular $\mathcal{D}$-classes form Abelian groups. This combinatorial description yields a normal form for…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
A group is metabelian if its commutator subgroup is abelian. For finitely generated metabelian groups, classical commutative algebra, algebraic geometry and geometric group theory, especially the latter two subjects, can be brought to bear…
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…