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 and equationally Noetherian groups (2502.07427v1)

Published 11 Feb 2025 in math.GR

Abstract: A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w{G}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong conciseness imposes a more demanding condition on $w$, requiring that $w(G)$ is finite whenever $|w{G}|< 2{\aleph_0}$. We investigate the relation between these two properties and the notion of equationally Noetherian groups, by proving that in a profinite group $G$ with a dense equationally Noetherian subgroup, $w{G}$ is finite whenever $|w{G}|< 2{\aleph_0}$. Consequently, we conclude that every word is strongly concise in the classes of profinite linear groups, pro-$\mathcal{C}$ completions of residually $\mathcal{C}$ linear groups and pro-$\mathcal{C}$ completions of virtually abelian-by-polycyclic groups, thereby extending well-known conciseness properties of these classes of 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.