conjecture. 2 Conjecture.
Statement
conjecture. 2 Conjecture. For any \varepsilon > 0 we have N (T ) ≪\varepsilon T n +1+\varepsilon . For n \leq 3 it is possible to prove the conjectured bound by examining the underlying system of n2 quadratic equations in 2n2 variables, but it seems too complicated to do so when n is large. The following is our main result. 2 Theorem 1. We have N (T ) ≪\varepsilon T n +2−2/(n+1) . Stratification of exponential sums and commuting matrices Tim Browning (joint work with Will Sawin and Victor Wang)
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.