The Length of Elements in Free Solvable Groups
Carl Droms, Jacques Lewin, Herman Servatius
Abstract
Carl Droms, Jacques Lewin, Herman Servatius
Abstract
We examine the relationship between the complexity of the word problem for a presentation and the complexity of the problem of determining the length of a shortest word equivalent to a given word. Our main result is that the length of the element represented by a word in a free solvable group can be determined in polynomial time.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We examine the relationship between the complexity of the word problem for a presentation and the complexity of the problem of determining the length of a shortest word equivalent to a given word. Our main result is that the length of the element represented by a word in a free solvable group can be determined in polynomial time.
Key concepts: Word (group theory), Word problem (mathematics education), Word length, Presentation (obstetrics), Mathematics, Element (criminal law), Polynomial, Combinatorics