14 problems
Arithmetic removal conjecture. If and the number of vectors satisfying is , then
Let be a non-degenerate genus-one translation-invariant system of equations over , where each is a translation-invariant equation in va…
Let be a homogeneous linear equation with , where satisfy … but there exists a…
Odd-length uncommonness conjecture. The equation is uncommon over the integers.
Let \boldsymbol{[?] be a -system, and let denote the length of its shortest equation, where the length of an equation is the number of nonzero coefficients…
Consider a linear equation … where are integers. The equation has genus one if … and for every nonempty proper subset . Le…
Let be a -system of linear equations, and let denote the parameter used in the paper. Assume that . Non-Sidorenko conjecture. Every -sy…
Uncommon -system conjecture. For even and sufficiently large odd , every -system satisfying
Let and consider the equation … A canceling partition is a partition of the coefficients into pairs such that . Call the equat…
Let , let , and consider the equation … For a coloring , call a solution monochromatic…
Let be a prime power, let be a positive integer, and let . Consider the linear equation over … The equation is common if, for every two-coloring of…
For a positive integer , let an equation be -regular when every coloring of the positive integers with colors has a monochromatic positive-integer solution. Lower-bound c…
Let be a possibly infinite set of systems of induced equations, and let a Boolean function be -free when it contains no induced solution of any system in…
Green's conjecture. Every system of homogeneous linear equations has the removal property.