The complexity of intersecting subproducts with subgroups in Cartesian powers

TL;DR

This paper investigates the computational complexity of intersecting specific subsets in Cartesian powers of finite abelian groups, establishing NP-completeness results and polynomial-time solvability conditions.

Contribution

It provides a complete classification of the complexity of intersection problems for Cartesian powers of finite abelian groups, identifying when they are NP-complete or polynomial-time solvable.

Findings

Intersection decision problem is NP-complete in general.

Complete classification for fixed groups and subsets.

Polynomial-time solvability in certain cases.

Abstract

Given a finite abelian group $G$ and $t\in \mathbb{N}$, there are two natural types of subsets of the Cartesian power $G^t$; namely, Cartesian powers $S^t$ where $S$ is a subset of $G$, and (cosets of) subgroups $H$ of $G^t$. A basic question is whether two such sets intersect. In this paper, we show that this decision problem is NP-complete. Furthermore, for fixed $G$ and $S$ we give a complete classification: we determine conditions for when the problem is NP-complete, and show that in all other cases the problem is solvable in polynomial time. These theorems play a key role in the classification of algebraic decision problems in finitely generated rings developed in [Spe21].