The algorithms that recognize Milnor laws and properties of these laws
We consider several equivalent definitions of the so-called Milnorlaws (or Milnor identities) that is the laws which are not satisfied in \(\mathfrak{A}_p\mathfrak{A}\) varieties. The purpose of this article is to provide algorithms that allow us to check whether a given identity \(w(x,y)\) has one...
Збережено в:
| Дата: | 2018 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Lugansk National Taras Shevchenko University
2018
|
| Теми: | |
| Онлайн доступ: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1040 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Algebra and Discrete Mathematics |
Репозитарії
Algebra and Discrete Mathematics| Резюме: | We consider several equivalent definitions of the so-called Milnorlaws (or Milnor identities) that is the laws which are not satisfied in \(\mathfrak{A}_p\mathfrak{A}\) varieties. The purpose of this article is to provide algorithms that allow us to check whether a given identity \(w(x,y)\) has one of the following properties:\(w(x,y)\) is a Milnor law,every nilpotent group satisfying \(w(x,y)\) is abelian,every finitely generated metabelian group satisfying \(w(x,y)\) is finite-by-abelian. |
|---|