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...
Saved in:
Date: | 2018 |
---|---|
Main Author: | Tomaszewski, Witold |
Format: | Article |
Language: | English |
Published: |
Lugansk National Taras Shevchenko University
2018
|
Subjects: | |
Online Access: | https://admjournal.luguniv.edu.ua/index.php/adm/article/view/1040 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Algebra and Discrete Mathematics |
Institution
Algebra and Discrete MathematicsSimilar Items
-
Minimal non-\(PC\)-groups
by: Artemovych, Orest D.
Published: (2018) -
On a question of Wiegold and torsion images of Coxeter groups
by: Grigorchuk, Rostislav
Published: (2018) -
On well \(p\)-embedded subgroups of finite groups
by: Hutsko, Nataliya V., et al.
Published: (2018) -
\(\mathbf{S}\)-Embedded subgroups in finite groups
by: Ballester-Bolinches, A., et al.
Published: (2018) -
A geometrical interpretation of infinite wreath powers
by: Mikaelian, Vahagn H.
Published: (2018)