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| id |
oai:ojs.admjournal.luguniv.edu.ua:article-1040 |
|---|---|
| record_format |
ojs |
| spelling |
oai:ojs.admjournal.luguniv.edu.ua:article-10402018-04-26T02:11:00Z The algorithms that recognize Milnor laws and properties of these laws Tomaszewski, Witold group laws, Milnor laws, metabelian groups 20E10, 20F16 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. Lugansk National Taras Shevchenko University 2018-04-26 Article Article Peer-reviewed Article application/pdf https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1040 Algebra and Discrete Mathematics; Vol 17, No 2 (2014) 2415-721X 1726-3255 en https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1040/562 Copyright (c) 2018 Algebra and Discrete Mathematics |
| institution |
Algebra and Discrete Mathematics |
| collection |
OJS |
| language |
English |
| topic |
group laws Milnor laws metabelian groups 20E10 20F16 |
| spellingShingle |
group laws Milnor laws metabelian groups 20E10 20F16 Tomaszewski, Witold The algorithms that recognize Milnor laws and properties of these laws |
| topic_facet |
group laws Milnor laws metabelian groups 20E10 20F16 |
| format |
Article |
| author |
Tomaszewski, Witold |
| author_facet |
Tomaszewski, Witold |
| author_sort |
Tomaszewski, Witold |
| title |
The algorithms that recognize Milnor laws and properties of these laws |
| title_short |
The algorithms that recognize Milnor laws and properties of these laws |
| title_full |
The algorithms that recognize Milnor laws and properties of these laws |
| title_fullStr |
The algorithms that recognize Milnor laws and properties of these laws |
| title_full_unstemmed |
The algorithms that recognize Milnor laws and properties of these laws |
| title_sort |
algorithms that recognize milnor laws and properties of these laws |
| description |
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. |
| publisher |
Lugansk National Taras Shevchenko University |
| publishDate |
2018 |
| url |
https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1040 |
| work_keys_str_mv |
AT tomaszewskiwitold thealgorithmsthatrecognizemilnorlawsandpropertiesoftheselaws AT tomaszewskiwitold algorithmsthatrecognizemilnorlawsandpropertiesoftheselaws |
| first_indexed |
2024-04-12T06:25:33Z |
| last_indexed |
2024-04-12T06:25:33Z |
| _version_ |
1796109204694499328 |