pith. sign in

arxiv: 1604.01757 · v1 · pith:K6K2EOCDnew · submitted 2016-04-06 · 🧮 math.GR · cs.CC

On semigroups with PSPACE-complete subpower membership problem

classification 🧮 math.GR cs.CC
keywords semigroupsmatrixpspace-completecombinatorialldotsmembershipnp-completeproblem
0
0 comments X
read the original abstract

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$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.