Answers are grounded in this paper and cite their sources.
By making use of arithmetic information inequalities, we give a strong quantitative bound for the discretised ring theorem. In particular, we show that if is a ‐set, with , then or has ‐covering number at least for any , provided that is small enough.
No takes yet. Share an insight, caveat, or question.
A 2025 study studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: