On the complexity of finding and counting solution-free sets of integers

Kitty Meeks, Andrew Treglown

Given a linear equation $\mathcal{L}$, a set $A$ of integers is $\mathcal{L}$-free if $A$ does not contain any `non-trivial' solutions to $\mathcal{L}$. This notion incorporates ma…