Papers
Topics
Authors
Recent
Search
2000 character limit reached

On semigroups with PSPACE-complete subpower membership problem

Published 6 Apr 2016 in math.GR and cs.CC | (1604.01757v1)

Abstract: Fix a finite semigroup $S$ and let $a_1, \ldots, a_k, b$ be tuples in a direct power $Sn$. 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$.

Citations (3)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.