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

Strong conciseness of Engel words in profinite groups (2108.11789v1)

Published 25 Aug 2021 in math.GR

Abstract: A group word $w$ is said to be strongly concise in a class $\mathscr C$ of profinite groups if, for any group $G$ in $\mathscr C$, either $w$ takes at least continuum values in $G$ or the verbal subgroup $w(G)$ is finite. It is conjectured that all words are strongly concise in the class of all profinite groups. Earlier Detomi, Klopsch, and Shumyatsky proved this conjecture for multilinear commutator words, as well as for some other particular words. They also proved that every group word is strongly concise in the class of nilpotent profinite groups. In the present paper we prove that for any $n$ the $n$-Engel word $[...[x,y],y],\dots y]$ (where $y$ is repeated $n$ times) is strongly concise in the class of finitely generated profinite 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.

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube