<p>A word <i>w</i> is <i>concise</i> in a class of groups <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation> if, for every group <i>G</i> in <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\mathcal {C}\)</EquationSource> <EquationSource Format="MATHML"><math> <mi mathvariant="script">C</mi> </math></EquationSource> </InlineEquation>, the verbal subgroup <i>w</i>(<i>G</i>) is finite whenever <i>w</i> takes only finitely many values in <i>G</i>. This notion can be naturally extended to first-order formulae in the language of groups. We consider this more general setting and establish conciseness for various classes of groups and formulae. We prove that all formulae are concise in the class of abelian groups and that every existential formula is concise in the class of torsion-free class-2 nilpotent groups. In addition, we construct new examples of weakly rational words, which allow us to produce a wide variety of formulae that are concise in the class of residually finite groups.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Conciseness of first-order formulae

  • Martina Conte,
  • J. Moritz Petschick

摘要

A word w is concise in a class of groups \(\mathcal {C}\) C if, for every group G in \(\mathcal {C}\) C , the verbal subgroup w(G) is finite whenever w takes only finitely many values in G. This notion can be naturally extended to first-order formulae in the language of groups. We consider this more general setting and establish conciseness for various classes of groups and formulae. We prove that all formulae are concise in the class of abelian groups and that every existential formula is concise in the class of torsion-free class-2 nilpotent groups. In addition, we construct new examples of weakly rational words, which allow us to produce a wide variety of formulae that are concise in the class of residually finite groups.