The square root law and structure of finite rings

From MaRDI portal
Publication:2011958

zbMATH Open1429.11214arXiv1405.7657MaRDI QIDQ2011958FDOQ2011958


Authors: Alex Iosevich, Brendan Murphy, Jonathan Pakianathan Edit this on Wikidata


Publication date: 27 July 2017

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Abstract: Let R be a finite ring and define the hyperbola H=(x,y)inRimesR:xy=1. Suppose that for a sequence of finite odd order rings of size tending to infinity, the following "square root law" bound holds with a constant C>0 for all non-trivial characters chi on R2: [ left| sum_{(x,y)in H}chi(x,y) ight|leq Csqrt{|H|}. ] Then, with a finite number of exceptions, those rings are fields. For rings of even order we show that there are other infinite families given by Boolean rings and Boolean twists which satisfy this square-root law behavior. We classify the extremal rings, those for which the left hand side of the expression above satisfies the worst possible estimate. We also describe applications of our results to problems in graph theory and geometric combinatorics. These results provide a quantitative connection between the square root law in number theory, Salem sets, Kloosterman sums, geometric combinatorics, and the arithmetic structure of the underlying rings.


Full work available at URL: https://arxiv.org/abs/1405.7657




Recommendations





Cited In (2)





This page was built for publication: The square root law and structure of finite rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011958)