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
-
The algorithms that recognize Milnor laws and properties of these laws
by: W. Tomaszewski
Published: (2014) -
The algorithms that recognize Milnor laws and properties of these laws
by: Tomaszewski, W.
Published: (2014) -
On Kaluzhnin-Krasner’s embedding of groups
by: Olshanskii, A. Yu.
Published: (2018) -
LAWS OF ELECTRICAL GRID ANALYSIS
by: Kutkovetskyy, V. J.
Published: (2014) -
On Sushchansky \(p\)-groups
by: Bondarenko, Ievgen V., et al.
Published: (2018)