We can get lower bounds for the Type I off-diagonal terms using sifted sequences.
Statement
We can get lower bounds for the Type I off-diagonal terms using sifted sequences. Is there any analog of this for Type II terms? Can one improve lower bounds for in this way (as in Goldston-Gonek-Ozluk-Snyder)?
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.