Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 77 tok/s
Gemini 2.5 Pro 56 tok/s Pro
GPT-5 Medium 34 tok/s Pro
GPT-5 High 35 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 208 tok/s Pro
GPT OSS 120B 462 tok/s Pro
Claude Sonnet 4.5 36 tok/s Pro
2000 character limit reached

Words of Engel type are concise in residually finite groups. Part II (1905.07784v1)

Published 19 May 2019 in math.GR

Abstract: Given a group-word w and a group G, the verbal subgroup w(G) is the one generated by all w-values in G. The word w is called concise if w(G) is finite whenever the set of w-values in G is finite. It is an open question whether every word is concise in residually finite groups. Let w=w(x_1,..,x_k) be a multilinear commutator word, n a positive integer and q a prime power. In the present article we show that the word [wq,_n y] is concise in residually finite groups while the word [w,_n y] is boundedly concise in residually finite groups.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.