arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.00324math.GR
收藏

关于部分双射半群性质复杂性的研究

On the Complexity of Properties of Partial Bijection Semigroups

Illinois Wesleyan University(伊利诺伊卫斯理大学)

Trevor Jack

AI总结:

本文研究部分双射半群性质检验的计算复杂性,证明枚举单位元和完全正则性检验属于AC$^0$,给出逆半群恒等式检验的非确定性对数空间算法,并通过矩形铺砖问题归约证明幂等元成员资格问题是PSPACE完全的。

摘要:

我们考察一类问题的计算复杂性:给定一个部分双射半群的生成元,要求检验所生成半群的性质。我们证明以下问题属于AC$^0$:(1)枚举左单位元和右单位元;(2)检验该半群是否完全正则。我们还描述了一个非确定性对数空间算法,用于检验由生成元给出的逆半群是否满足一个可能含有一元逆运算的固定半群恒等式。最后,我们给出另一个证明,说明检验给定幂等元是否属于某个部分双射半群是PSPACE完全问题。该证明从著名的PSPACE完全矩形铺砖问题归约而来,从而揭示了Wang铺砖与部分双射半群之间的联系。

英文摘要:

We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$^0$: (1) enumerating left and right identities and (2) checking if the semigroup is completely regular. We also describe a nondeterministic logspace algorithm for checking if an inverse semigroup given by generators satisfies a fixed semigroup identity that may involve a unary inverse operation. We conclude with an alternative proof that checking membership of a given idempotent in a partial bijection semigroup is a PSPACE-complete problem. The proof reduces from the well-known PSPACE-complete Rectangle Tiling Problem, thereby illustrating a connection between Wang tilings and partial bijection semigroups.

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

↑