English

On semigroups with PSPACE-complete subpower membership problem

Group Theory 2019-02-20 v1 Computational Complexity

Abstract

Fix a finite semigroup SS and let a1,,ak,ba_1, \ldots, a_k, b be tuples in a direct power SnS^n. The subpower membership problem (SMP) for SS asks whether bb can be generated by a1,,aka_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 66-element Brandt monoid, the full transformation semigroup on 33 or more letters, and semigroups of all nn by nn matrices over a field for n2n\ge 2.

Keywords

Cite

@article{arxiv.1604.01757,
  title  = {On semigroups with PSPACE-complete subpower membership problem},
  author = {Markus Steindl},
  journal= {arXiv preprint arXiv:1604.01757},
  year   = {2019}
}
R2 v1 2026-06-22T13:26:49.592Z