半群的次幂隶属问题
The subpower membership problem for semigroups
摘要:
固定一个有限半群$S$,设$a_1,\ldots,a_k, b$是直幂$S^n$中的元组.次幂成员问题(SMP)询问$b$是否可以由$a_1,\ldots,a_k$生成。如果$S$是一个有限群,那么在$nk$中有一个用时间多项式判定这个问题的民间算法。对于半群,这个问题总是在PSPACE中。对于交换半群,我们给出了一个二分法:如果交换半群$S$嵌入Clifford半群与幂零半群的直积中,则SMP(S)在P中,否则SMP(S)是NP-完全的.
英文摘要:
Fix a finite semigroup $S$ and let $a_1,\ldots,a_k, b$ be tuples in a direct power $S^n$. The subpower membership problem (SMP) asks whether $b$ can be generated by $a_1,\ldots,a_k$. If $S$ is a finite group, then there is a folklore algorithm that decides this problem in time polynomial in $nk$. For semigroups this problem always lies in PSPACE. We show that the SMP for a full transformation semigroup on 3 letters or more is actually PSPACE-complete, while on 2 letters it is in P. For commutative semigroups, we provide a dichotomy result: if a commutative semigroup $S$ embeds into a direct product of a Clifford semigroup and a nilpotent semigroup, then SMP(S) is in P; otherwise it is NP-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。