A Computational Approach to Verbal Width for Engel Words in Alternating Groups†
School of Computing, Jordanstown Campus, Ulster University, Northern Ireland BT37 0QB, UK
This paper is an extended version of our paper published in Lecture Notes of the XVII ’Jacques-Louis Lions’ Spanish-French School. Computational Mathematics, Numerical Analysis and Applications (Springer, 2017).
Received: 18 June 2019 / Revised: 1 July 2019 / Accepted: 2 July 2019 / Published: 3 July 2019
PDF [282 KB, uploaded 5 July 2019]
It is known that every element in the alternating group
, can be written as a product of at most two Engel words of arbitrary length. However, it is still unknown if every element in an alternating group is an Engel word of Arbitrary length. In this paper, a different approach to this problem is presented, getting new results for small alternating groups.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Martínez Carracedo, J. A Computational Approach to Verbal Width for Engel Words in Alternating Groups. Symmetry 2019, 11, 877.
Martínez Carracedo J. A Computational Approach to Verbal Width for Engel Words in Alternating Groups. Symmetry. 2019; 11(7):877.
Martínez Carracedo, Jorge. 2019. "A Computational Approach to Verbal Width for Engel Words in Alternating Groups." Symmetry 11, no. 7: 877.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.