Fundamentalʹnaâ i prikladnaâ matematika, Tome 21 (2016) no. 1, pp. 145-163
Citer cet article
V. N. Latyshev. Finite combinatorial generation of metabelian $T$-ideal. Fundamentalʹnaâ i prikladnaâ matematika, Tome 21 (2016) no. 1, pp. 145-163. http://geodesic.mathdoc.fr/item/FPM_2016_21_1_a12/
@article{FPM_2016_21_1_a12,
author = {V. N. Latyshev},
title = {Finite combinatorial generation of metabelian $T$-ideal},
journal = {Fundamentalʹna\^a i prikladna\^a matematika},
pages = {145--163},
year = {2016},
volume = {21},
number = {1},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/FPM_2016_21_1_a12/}
}
TY - JOUR
AU - V. N. Latyshev
TI - Finite combinatorial generation of metabelian $T$-ideal
JO - Fundamentalʹnaâ i prikladnaâ matematika
PY - 2016
SP - 145
EP - 163
VL - 21
IS - 1
UR - http://geodesic.mathdoc.fr/item/FPM_2016_21_1_a12/
LA - ru
ID - FPM_2016_21_1_a12
ER -
%0 Journal Article
%A V. N. Latyshev
%T Finite combinatorial generation of metabelian $T$-ideal
%J Fundamentalʹnaâ i prikladnaâ matematika
%D 2016
%P 145-163
%V 21
%N 1
%U http://geodesic.mathdoc.fr/item/FPM_2016_21_1_a12/
%G ru
%F FPM_2016_21_1_a12
In this work, we develop our idea on the construction of a system of combinatorial generators in a $T$-ideal of a free associative algebra, which is a full analogy of a Gröbner–Shirshov basis in a polynomial ideal. We prove a theorem on multilinear monomials that enables us to establish the existence of a finite set of combinatorial generators in a metabelian $T$-ideal.