Equations over Finite Monoids with Infinite Promises

TL;DR

This paper extends the complexity classification of solving equations over finite monoids to cases with arbitrary relations and finitely generated monoids, broadening previous algebraic results.

Contribution

It provides a complexity dichotomy for equations over monoids with added relations and finitely generated monoids, advancing algebraic CSP analysis.

Findings

Established a complexity dichotomy for equations with arbitrary relations.

Extended classification to finitely generated monoids.

Built upon algebraic promise CSP framework.

Abstract

Larrauri and \v{Z}ivn\'y [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid $N$ assuming that a solution exists over a monoid $M$, where both monoids are finite and $M$ admits a homomorphism to $N$. Using the algebraic approach to promise constraint satisfaction problems, we extend their complexity classification in two directions: we obtain a complexity dichotomy in the case where arbitrary relations are added to the monoids, and we moreover allow the monoid $M$ to be finitely generated.