A Computational Approach to Verbal Width in Alternating Groups

Jorge Martinez Carracedo, Consuelo Martinez Lopez

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

We know that every element in an Alternating group An, n ≥ 5, can be written as a Engel word of length two (Carracedo, Extracta Math. 30(2), 251–262, 2015 and J. Algebra Appl. 16(2), 1750021, 10 p., 2017). There is a conjecture that every element in an Alternating group An, n ≥ 5, can be written as an Engel word of arbitrary length. We give here a computational approach to this problem, what allows to prove the conjecture for 5 ≤ n ≤ 14.
Original languageEnglish
Title of host publicationComputational Mathematics, Numerical Analysis and Applications
Subtitle of host publicationLecture Notes of the XVII 'Jacques-Louis Lions' Spanish-French School
PublisherSpringer Cham
Volume13
Edition1
ISBN (Electronic)978-3-319-49631-3
ISBN (Print)978-3-319-49630-6
Publication statusPublished - 2017

Fingerprint

Dive into the research topics of 'A Computational Approach to Verbal Width in Alternating Groups'. Together they form a unique fingerprint.

Cite this