A new algorithm for constraint satisfaction problems with few subpowers templates

TL;DR

This paper introduces a novel algorithm for solving constraint satisfaction problems over templates with few subpowers, combining linear algebra over finite fields and algebraic reductions to improve efficiency.

Contribution

The paper presents a new algorithm that leverages algebraic structures and linear algebra techniques to solve CSPs with few subpowers more effectively.

Findings

Algorithm reduces CSP solving to linear systems over finite fields.

Uses absorbing subuniverses for problem reduction.

Achieves improved computational efficiency for specific CSP classes.

Abstract

In this article, we provide a new algorithm for solving constraint satisfaction problems over templates with few subpowers, by reducing the problem to the combination of solvability of a polynomial number of systems of linear equations over finite fields and reductions via absorbing subuniverses.