skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Gorodetsky, Ofir"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract We evaluate asymptotically the variance of the number of squarefree integers up to x in short intervals of length $$H < x^{6/11 - \varepsilon }$$ H < x 6 / 11 - ε and the variance of the number of squarefree integers up to x in arithmetic progressions modulo q with $$q > x^{5/11 + \varepsilon }$$ q > x 5 / 11 + ε . On the assumption of respectively the Lindelöf Hypothesis and the Generalized Lindelöf Hypothesis we show that these ranges can be improved to respectively $$H < x^{2/3 - \varepsilon }$$ H < x 2 / 3 - ε and $$q > x^{1/3 + \varepsilon }$$ q > x 1 / 3 + ε . Furthermore we show that obtaining a bound sharp up to factors of $$H^{\varepsilon }$$ H ε in the full range $$H < x^{1 - \varepsilon }$$ H < x 1 - ε is equivalent to the Riemann Hypothesis. These results improve on a result of Hall (Mathematika 29(1):7–17, 1982) for short intervals, and earlier results of Warlimont, Vaughan, Blomer, Nunes and Le Boudec in the case of arithmetic progressions. 
    more » « less