Abstract
The theory of Engel groups plays an important role in group theory since they are closely related to the Burnside problems.
In this survey we consider several classical and novel algorithmic problems for Engel groups and propose several open problems. We study these problems with a view towards applications to cryptog- raphy.
In this survey we consider several classical and novel algorithmic problems for Engel groups and propose several open problems. We study these problems with a view towards applications to cryptog- raphy.
Original language | English |
---|---|
Number of pages | 18 |
Journal | International Journal of Group Theory |
Early online date | 8 Feb 2020 |
DOIs | |
Publication status | E-pub ahead of print - 8 Feb 2020 |