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

关于具有PSPACE-完全次幂隶属问题的半群

On semigroups with PSPACE-complete subpower membership problem

Markus Steindl

摘要:

固定一个有限半群$S$,设$a_1, \ldots, a_k, b$是直幂$S^n$中的元组. $S$的次幂成员问题(SMP)询问$b$是否可以由$a_1, \ldots, a_k$生成。对于组合Rees矩阵半群,我们建立了一个二分法结果:如果对应的矩阵具有某种形式,则SMP在P中,否则它是NP-完全的。对于具有伴随单位元的组合Rees矩阵半群,我们得到了一个可分性:SMP在P中,NP-完全或PSPACE-完全.这个结果得到了各种具有PSPACE-完全SMP的半群,包括$6$ -元Brandt幺半群,$3$或多个字母上的全变换半群,以及域上所有$n$乘$n$矩阵的半群,其中$n\ge 2$是$n\ge 2$ .

英文摘要:

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) for $S$ asks whether $b$ can be generated by $a_1, \ldots, a_k$. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups with adjoined identity, we obtain a trichotomy: the SMP is either in P, NP-complete, or PSPACE-complete. This result yields various semigroups with PSPACE-complete SMP including the $6$-element Brandt monoid, the full transformation semigroup on $3$ or more letters, and semigroups of all $n$ by $n$ matrices over a field for $n\ge 2$.

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

↑