arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.00992math.RAcs.DM
收藏

自由多项式强双半群

Free polynomial strong bimonoids

Leipzig University(莱比锡大学);University of Szeged(塞格德大学)

Manfred Droste, Zoltán Fülöp

AI总结:

本文在未定元集合上定义多项式运算,构造了自由右分配强双半群,证明了项等价性的指数时间可判定性,并推导了幂等情形及在加权自动机理论中的应用。

摘要:

近期,在加权自动机理论中,强双半群的权重结构引起了广泛关注;它们构成了半环的推广,并且与代数学中研究的近半环密切相关。在此,我们在一组未定元集合$X$上定义了多项式,以及加法和乘法。我们证明了在这些运算下,它们构成了一个右分配强双半群,该多项式强双半群在所有右分配强双半群构成的类中对$X$是自由的,并且它既是左可消的也是右可消的。我们通过纯代数推理证明,两个任意项模右分配强双半群律等价,当且仅当它们的表示多项式仅模加法结合律与交换律以及乘法结合律等价。我们给出了构造表示多项式的有效过程。由此得出,任意项模右分配强双半群律的等价性可在指数时间内判定。使用项重写方法,我们证明了每个项均可归约为唯一的多项式作为范式。我们还推导了$X$上自由幂等右分配多项式强双半群的相应结果。我们构造了一个弱局部有限但非局部有限的幂等强双半群,并展示了其在加权自动机理论中的应用。

英文摘要:

Recently, in weighted automata theory the weight structure of strong bimonoids has found much interest; they form a generalization of semirings and are closely related to near-semirings studied in algebra. Here, we define polynomials over a set $X$ of indeterminates as well as an addition and a multiplication. We show that with these operations, they form a right-distributive strong bimonoid, that this polynomial strong bimonoid is free over $X$ in the class of all right-distributive strong bimonoids and that it is both left- and right-cancellative. We show by purely algebraic reasoning that two arbitrary terms are equivalent modulo the laws of right-distributive strong bimonoids if and only if their representing polynomials are equivalent by the laws of only associativity and commutativity of addition and associativity of multiplication. We give effective procedures for constructing the representing polynomials. As a consequence, we obtain that the equivalence of arbitrary terms modulo the laws of right-distributive strong bimonoids can be decided in exponential time. Using term-rewriting methods, we show that each term can be reduced to a unique polynomial as normal form. We also derive corresponding results for the free idempotent right-distributive polynomial strong bimonoid over $X$. We construct an idempotent strong bimonoid which is weakly locally finite but not locally finite and show an application of it in weighted automata theory.

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

↑