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.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: On the variance of squarefree integers in short intervals and arithmetic progressions
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
Award ID(s):
1902063
PAR ID:
10377025
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Geometric and Functional Analysis
Volume:
31
Issue:
1
ISSN:
1016-443X
Page Range / eLocation ID:
111 to 149
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Compositio Mathematica)
    Celebrated theorems of Roth and of Matoušek and Spencer together show that the discrepancy of arithmetic progressions in the first $$n$$ positive integers is $$\Theta (n^{1/4})$$ . We study the analogous problem in the $$\mathbb {Z}_n$$ setting. We asymptotically determine the logarithm of the discrepancy of arithmetic progressions in $$\mathbb {Z}_n$$ for all positive integer $$n$$ . We further determine up to a constant factor the discrepancy of arithmetic progressions in $$\mathbb {Z}_n$$ for many $$n$$ . For example, if $n=p^k$ is a prime power, then the discrepancy of arithmetic progressions in $$\mathbb {Z}_n$$ is $$\Theta (n^{1/3+r_k/(6k)})$$ , where $$r_k \in \{0,1,2\}$$ is the remainder when $$k$$ is divided by $$3$$ . This solves a problem of Hebbinghaus and Srivastav. 
    more » « less
  2. ; ; ; (, Forum of Mathematics, Pi)
    Abstract We study higher uniformity properties of the Möbius function$$\mu $$, the von Mangoldt function$$\Lambda $$, and the divisor functions$$d_k$$on short intervals$$(X,X+H]$$with$$X^{\theta +\varepsilon } \leq H \leq X^{1-\varepsilon }$$for a fixed constant$$0 \leq \theta < 1$$and any$$\varepsilon>0$$. More precisely, letting$$\Lambda ^\sharp $$and$$d_k^\sharp $$be suitable approximants of$$\Lambda $$and$$d_k$$and$$\mu ^\sharp = 0$$, we show for instance that, for any nilsequence$$F(g(n)\Gamma )$$, we have$$\begin{align*}\sum_{X < n \leq X+H} (f(n)-f^\sharp(n)) F(g(n) \Gamma) \ll H \log^{-A} X \end{align*}$$ when$$\theta = 5/8$$and$$f \in \{\Lambda , \mu , d_k\}$$or$$\theta = 1/3$$and$$f = d_2$$. As a consequence, we show that the short interval Gowers norms$$\|f-f^\sharp \|_{U^s(X,X+H]}$$are also asymptotically small for any fixedsfor these choices of$$f,\theta $$. As applications, we prove an asymptotic formula for the number of solutions to linear equations in primes in short intervals and show that multiple ergodic averages along primes in short intervals converge in$$L^2$$. Our innovations include the use of multiparameter nilsequence equidistribution theorems to control type$$II$$sums and an elementary decomposition of the neighborhood of a hyperbola into arithmetic progressions to control type$$I_2$$sums. 
    more » « less
  3. ; (, Combinatorics, Probability and Computing)
    Abstract Let $$\mathrm{AP}_k=\{a,a+d,\ldots,a+(k-1)d\}$$ be an arithmetic progression. For $$\varepsilon>0$$ we call a set $$\mathrm{AP}_k(\varepsilon)=\{x_0,\ldots,x_{k-1}\}$$ an $$\varepsilon$$ -approximate arithmetic progression if for some a and d , $$|x_i-(a+id)|<\varepsilon d$$ holds for all $$i\in\{0,1\ldots,k-1\}$$ . Complementing earlier results of Dumitrescu (2011, J. Comput. Geom. 2 (1) 16–29), in this paper we study numerical aspects of Van der Waerden, Szemerédi and Furstenberg–Katznelson like results in which arithmetic progressions and their higher dimensional extensions are replaced by their $$\varepsilon$$ -approximation. 
    more » « less
  4. ; (, Random Structures & Algorithms)
    Abstract Letfs, k(n)be the maximum possible number ofs‐term arithmetic progressions in a set ofnintegers which contains nok‐term arithmetic progression. For all fixed integersk > s ≥ 3, we prove thatfs, k(n) = n2 − o(1), which answers an old question of Erdős. In fact, we prove upper and lower bounds forfs, k(n)which show that its growth is closely related to the bounds in Szemerédi's theorem. 
    more » « less
  5. ; ; ; (, Graphs and Combinatorics)
    Abstract Recently, Dvořák, Norin, and Postle introduced flexibility as an extension of list coloring on graphs (J Graph Theory 92(3):191–206, 2019, https://doi.org/10.1002/jgt.22447 ). In this new setting, each vertex v in some subset of V ( G ) has a request for a certain color r ( v ) in its list of colors L ( v ). The goal is to find an L coloring satisfying many, but not necessarily all, of the requests. The main studied question is whether there exists a universal constant $$\varepsilon >0$$ ε > 0 such that any graph G in some graph class $$\mathscr {C}$$ C satisfies at least $$\varepsilon$$ ε proportion of the requests. More formally, for $$k > 0$$ k > 0 the goal is to prove that for any graph $$G \in \mathscr {C}$$ G ∈ C on vertex set V , with any list assignment L of size k for each vertex, and for every $$R \subseteq V$$ R ⊆ V and a request vector $$(r(v): v\in R, ~r(v) \in L(v))$$ ( r ( v ) : v ∈ R , r ( v ) ∈ L ( v ) ) , there exists an L -coloring of G satisfying at least $$\varepsilon |R|$$ ε | R | requests. If this is true, then $$\mathscr {C}$$ C is called $$\varepsilon$$ ε - flexible for lists of size k . Choi, Clemen, Ferrara, Horn, Ma, and Masařík (Discrete Appl Math 306:20–132, 2022, https://doi.org/10.1016/j.dam.2021.09.021 ) introduced the notion of weak flexibility , where $$R = V$$ R = V . We further develop this direction by introducing a tool to handle weak flexibility. We demonstrate this new tool by showing that for every positive integer b there exists $$\varepsilon (b)>0$$ ε ( b ) > 0 so that the class of planar graphs without $$K_4, C_5 , C_6 , C_7, B_b$$ K 4 , C 5 , C 6 , C 7 , B b is weakly $$\varepsilon (b)$$ ε ( b ) -flexible for lists of size 4 (here $$K_n$$ K n , $$C_n$$ C n and $$B_n$$ B n are the complete graph, a cycle, and a book on n vertices, respectively). We also show that the class of planar graphs without $$K_4, C_5 , C_6 , C_7, B_5$$ K 4 , C 5 , C 6 , C 7 , B 5 is $$\varepsilon$$ ε -flexible for lists of size 4. The results are tight as these graph classes are not even 3-colorable. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email