Interpreting Graph Colorability in Finite Semigroups

We show that a number of natural membership problems for classes associated with finite semigroups are computationally difficult. In particular, we construct a 55-element semigroup S such that the finite membership problem for the variety of semigroups generated by S interprets the graph 3-colorability problem.

[1]  Mark Sapir,et al.  On the quasivaieties generated by finite semigroups , 1980 .

[2]  Giora Slutzki,et al.  Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras , 2000, SIAM J. Comput..

[3]  Z. Hedrlín,et al.  On full embeddings of categories of algebras , 1966 .

[4]  P. Erdös,et al.  Graph Theory and Probability , 1959 .

[5]  L. Lovász.  On chromatic number of finite set-systems , 1968 .

[6]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[7]  Steve Seif.  The Perkins Semigroup has Co-Np-Complete Term-Equivalence Problem , 2005, Int. J. Algebra Comput..

[8]  Finite Semigroups Whose Varieties Have Uncountably Many Subvarieties , 2000 .

[9]  Mikhail V. Volkov.  Checking quasi-identities in a finite semigroup may be computationally hard , 2004, Stud Logica.

[10]  Kellogg S. Booth,et al.  Isomorphism Testing for Graphs, Semigroups, and Finite Automata Are Polynomially Equivalent Problems , 1978, SIAM J. Comput..

[11]  M. Sapir.  Inherently Nonfinitely Based Finite Semigroups , 1988 .

[12]  Zoltán Székely.  Computational Complexity of The Finite Algebra Membership Problem for Varieties , 2002, Int. J. Algebra Comput..

[13]  Jaroslav Nesetril,et al.  On classes of relations and graphs determined by subobjects and factorobjects , 1978, Discret. Math..

[14]  X. Caicedo.  Finitely axiomatizable quasivarieties of graphs , 1995 .

[15]  The first order theory of $N$-colorable graphs , 1979 .