arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2402.08625math.GRmath.RA
收藏

零因子猜想与Mealy自动机

The zero divisor conjecture and Mealy automata

Ievgen Bondarenko, Kate Juschenko

AI总结:

本文将Mealy自动机与生成元配对关联,证明了零因子猜想对具有三个状态的可逆自动机对应的群成立,且不存在支撑为三的零因子。

摘要:

对于关系由生成元配对给定的某类有限展示群,证明零因子猜想是充分的。我们将Mealy自动机与这类配对相关联,并证明零因子猜想对对应于具有三个状态的可逆自动机的群成立。特别地,不可能存在对应于可逆配对的支撑为三的零因子。

英文摘要:

The zero divisor conjecture is sufficient to prove for certain class of finitely presented groups where the relations are given by a pairing of generators. We associate Mealy automata to such pairings, and prove that the zero divisor conjecture holds for groups corresponding to invertible automata with three states. In particular, there cannot be zero divisors of support three corresponding to invertible pairings.

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

↑