On semigroups with PSPACE-complete subpower membership problem

Abstract

Fix a finite semigroup S and let a1, …, ak, b be tuples in a direct power Sn. The subpower membership problem (SMP) for S asks whether b can be generated by a1, …, ak. 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 2.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…