The arithmetic removal conjecture for linear systems
Statement
Let be integers with , and let be an integer matrix of rank . For a positive integer, write ; a set is -free if there is no vector such that .
Arithmetic removal conjecture. If and the number of vectors satisfying is , then
where is -free and .
This conjecture asserts that a set containing only a negligible number of solutions to the homogeneous linear system can be made -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.