Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

On the Complexity of Properties of Partial Bijection Semigroups (2101.00324v1)

Published 1 Jan 2021 in math.GR

Abstract: We examine the computational complexity of problems in which we are given generators for a partial bijection semigroup and asked to check properties of the generated semigroup. We prove that the following problems are in AC$0$: (1) enumerating left and right identities and (2) checking if the semigroup is completely regular. We prove that checking membership of a given idempotent is a PSPACE-complete problem. We also describe a nondeterministic logspace algorithm for checking if an inverse semigroup given by generators satisfies a given semigroup identity that may involve a unary inverse operation.

Summary

We haven't generated a summary for this paper yet.