The algorithms that recognize Milnor laws and properties of these laws
We consider several equivalent definitions of the so-called Milnor laws (or Milnor identities) that is the laws which are not satisfied in ApA 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:...
Збережено в:
| Дата: | 2014 |
|---|---|
| Автор: | |
| Формат: | Стаття |
| Мова: | English |
| Опубліковано: |
Інститут прикладної математики і механіки НАН України
2014
|
| Назва видання: | Algebra and Discrete Mathematics |
| Онлайн доступ: | http://dspace.nbuv.gov.ua/handle/123456789/153340 |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
| Назва журналу: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Цитувати: | The algorithms that recognize Milnor laws and properties of these laws / W. Tomaszewski // Algebra and Discrete Mathematics. — 2014. — Vol. 17, № 2. — С. 308–332. — Бібліогр.: 38 назв. — англ. |
Репозитарії
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Резюме: | We consider several equivalent definitions of the so-called Milnor laws (or Milnor identities) that is the laws which are not satisfied in ApA 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. |
|---|