# The complexity of solution-free sets of integers for general linear equations

@article{Edwards2019TheCO, title={The complexity of solution-free sets of integers for general linear equations}, author={Keith J. Edwards and Steven D. Noble}, journal={Discret. Appl. Math.}, year={2019}, volume={270}, pages={115-133} }

## 2 Citations

Maximum k-sum n-free sets of the 2-dimensional integer lattice

- Mathematics
- 2020

For a positive integer n, let [n] denote {1, . . . , n}. For a 2-dimensional integer lattice point b and positive integers k > 2 and n, a k-sum b-free set of [n] × [n] is a subset S of [n] × [n] such…

Maximum $k$-Sum $\mathbf{n}$-Free Sets of the 2-Dimensional Integer Lattice

- Mathematics, Computer ScienceElectron. J. Comb.
- 2020

The maximum density of a $k$-sum $\mathbf{b}$-free set of $[n]\times [n]$ is determined, the first investigation of the non-homogeneous sum- free set problem in higher dimensions.

## References

SHOWING 1-9 OF 9 REFERENCES

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

- MathematicsDiscret. Appl. Math.
- 2018

The Complexity of Enumeration and Reliability Problems

- Mathematics, Computer ScienceSIAM J. Comput.
- 1979

For a large number of natural counting problems for which there was no previous indication of intractability, that they belong to the class of computationally eqivalent counting problems that are at least as difficult as the NP-complete problems.

Some Simplified NP-Complete Graph Problems

- Mathematics, Computer ScienceTheor. Comput. Sci.
- 1976

Extremal Problems in Number Theory

- Mathematics
- 2001

I would like to illustrate the problems which I shall investigate in this paper by an example. Denote by r&z) the maximum number of integers not exceeding n, no k of which form an arithmetic…

Sets of integers with no large sum-free subset

- Mathematics
- 2014

Answering a question of P. Erd}os from 1965, we show that for every " > 0 there is a set A of n integers with the following property: every set A 0 A with at least 1 + " n elements contains three…

Systems of distinct representatives and linear algebra

- Mathematics
- 1967

So me purposes of thi s paper are: (1) To take se riously the term , " term rank. " (2) To ma ke an issue of not " rea rra nging rows a nd colu mns" by not "a rranging" the m in the firs t place. (3)…

The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected

- Mathematics, Computer ScienceSIAM J. Comput.
- 1983

Several enumeration and reliability problems are shown to be # P-complete, and hence, at least as hard as NP-complete problems. Included are important problems in network reliability analysis,…