We investigate the computational complexity of the problem of deciding if an algebra homomorphism can be factored through an intermediate algebra. Specifically, we fix an algebraic language, \(\mathcal L\), and take as input an algebra homomorphism \(f:X\rightarrow Z\) between two finite \(\mathcal L\)-algebras X and Z, along with an intermediate finite \(\mathcal L\)-algebra Y. The decision problem asks whether there are homomorphisms \(g:X\rightarrow Y\) and \(h:Y\rightarrow Z\) such that \(f=hg\). We show that this problem is NP-complete for most languages.
This is a preview of subscription content, access via your institution.
Buy single article
Instant access to the full article PDF.
Tax calculation will be finalised during checkout.
Bergman, C., Slutzki, G.: Complexity of some problems concerning varieties and quasi-varieties of algebras. SIAM J. Comput. 30(2), 359–382 (2000)
Booth, K.S.: Isomorphism testing for graphs, semigroups, and finite automata are polynomially equivalent problems. SIAM J. Comput. 7(3), 273–279 (1978)
Distler, A., Mitchell, J.D.: The number of nilpotent semigroups of degree 3. Electron. J. Comb. 19(2), P51 (2012)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. Springer, Berlin (2006)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman and Co., San Francisco (1979)
Hedrlín, Z., Pultr, A.: On full embeddings of categories of algebras. Ill. J. Math. 10(3), 392–406 (1966)
Hell, P., Nešetřil, J.: Graphs and Homomorphisms. Oxford Lecture Series in Mathematics and Its Applications. Oxford University Press, Oxford (2004)
Hoffmann, C.M.: Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer Science, vol. 136. Springer, Berlin (1982)
Jackson, M., McKenzie, R.: Interpreting graph colorability in finite semigroups. Int. J. Algebra Comput. 16(01), 119–140 (2006)
Torán, J.: Reductions to graph isomorphism. Theory Comput. Syst. 47(1), 288–299 (2010)
Van Name, J.: Is there a good computer program for searching for endomorphisms between finite algebras which make diagrams commute? Is this problem NP–complete? https://mathoverflow.net/questions/261966/. Accessed 14 Feb 2018
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This material is based upon work supported by the National Science Foundation Grant no. DMS 1500254.
Communicated by Presented by R. Willard.
About this article
Cite this article
Berg, K.M. The complexity of homomorphism factorization. Algebra Univers. 82, 47 (2021). https://doi.org/10.1007/s00012-021-00742-5
- Homomorphism factorization
- Computational complexity
- Finite structures
Mathematics Subject Classification