加载中…
Based on the notions of conciseness and semiconciseness, we show that these properties are not equivalent by proving that a word originally presented by Ol’shanskii is semiconcise but not concise. We further establish that every -concise word is semiconcise by proving that when the group word takes finitely many values in , the iterated commutator subgroup is finite for some if and only if is finite.

生成讲解博客的中文版本

生成AI智能校验的中文版本