ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let r,mr,m be integers with r⩽mr \leqslant m, and let LL be an r×mr \times m integer matrix of rank rr. For NN a positive integer, write [N]={1,…,N}[N]=\{1,\ldots,N\}; a set A⊆[N]A\subseteq[N] is LL-free if there is no vector x∈Amx\in A^m such that Lx=0Lx=0.

Arithmetic removal conjecture. If A⊆[N]A\subseteq[N] and the number of vectors x∈Amx\in A^m satisfying Lx=0Lx=0 is o(Nm−r)o(N^{m-r}), then

A=B∪C,A=B\cup C,

where BB is LL-free and ∣C∣=o(N)|C|=o(N).

This conjecture asserts that a set containing only a negligible number of solutions to the homogeneous linear system Lx=0Lx=0 can be made LL-free by deleting a negligible number of elements. The source presents it as a consequence that might follow from a suitably formulated higher arithmetic regularity lemma; its resolution is not given here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.