arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.12810math.GRcs.FL
收藏

在半群自由积中保持自相似性

Preserving self-similarity in free products of semigroups

Tara Macalister Brough, Jan Philipp Wächter, Janette Welker

AI总结:

本文研究自相似半群与自动机半群在自由积下的封闭性,利用基础半群间的同态和可计算构造证明自由积保持相关性质,并给出添加自由生成元等推论及限制例子。

摘要:

我们改进了早先关于自动机半群类在自由积下封闭性的结果。我们考虑部分自动机,并证明:如果两个自相似半群(或自动机半群)中的一个基础半群到另一个存在同态,则它们的自由积是自相似的(即是自动机半群)。所采用的构造是可计算的,并产生进一步推论。其中之一是,我们可以向任意自相似半群(或自动机半群)添加一个自由生成元,同时保持自相似性(或作为自动机半群)的性质。两个半群之间存在同态是一个非常宽松的要求;特别是,当其中一个半群包含幂等元时,该要求就得到满足。为探究这一要求的界限,我们证明任何不含幂等元的单半群或0-单半群都不是有限生成的自相似半群(或自动机半群)。此外,我们给出一对剩余有限半群的例子,它们之间不存在从一个到另一个的同态。

英文摘要:

We improve on earlier results on the closure under free products of the class of automaton semigroups. We consider partial automata and show that the free product of two self-similar semigroups (or automaton semigroups) is self-similar (an automaton semigroup) if there is a homomorphism from one of the base semigroups to the other. The construction used is computable and yields further consequences. One of them is that we can adjoin a free generator to any self-similar semigroup (or automaton semigroup) and preserve the property of self-similarity (or being an automaton semigroup). The existence of a homomorphism between two semigroups is a very lax requirement; in particular, it is satisfied if one of the semigroups contains an idempotent. To explore the limits of this requirement, we show that no simple or $0$-simple idempotent-free semigroup is a finitely generated self-similar semigroup (or an automaton semigroup). Furthermore, we give an example of a pair of residually finite semigroups without a homomorphism from one to the other.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑