most citedThe complexity of solution-free sets of integers

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

math.CO2018★ 1 cited

The complexity of solution-free sets of integers

Keith J. Edwards, Steven D. Noble

Given a linear equation L, a set A of integers is L-free if A does not contain any non-trivial solutions to L. Meeks and Treglown showed that for certain kinds of linear equations,…