ORCID Profile
0000-0002-8347-0571
Current Organisations
Charles University
,
KTH Hållfasthetslära
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Elsevier BV
Date: 08-2019
Publisher: Elsevier BV
Date: 05-2020
Publisher: Cambridge University Press (CUP)
Date: 08-02-2022
Publisher: American Mathematical Society (AMS)
Date: 08-07-2020
DOI: 10.1090/TRAN/8138
Abstract: In this paper we obtain a new fully explicit constant for the Pólya-Vinogradov inequality for squarefree modulus. Given a primitive character χ \chi to squarefree modulus q q , we prove the following upper bound: | ∑ 1 ⩽ n ⩽ N χ ( n ) | ⩽ c q log q , \begin{align*} \left | \sum _{1 \leqslant n\leqslant N} \chi (n) \right |\leqslant c \sqrt {q} \log q, \end{align*} where c = 1 / ( 2 π 2 ) + o ( 1 ) c=1/(2\pi ^2)+o(1) for even characters and c = 1 / ( 4 π ) + o ( 1 ) c=1/(4\pi )+o(1) for odd characters, with an explicit o ( 1 ) o(1) term. This improves a result of Frolenkov and Soundararajan for large q q . We proceed via partial Gaussian sums rather than the usual Montgomery and Vaughan approach of exponential sums with multiplicative coefficients. This allows a power saving on the minor arcs rather than a factor of log q \log {q} as in previous approaches and is an important factor for fully explicit bounds.
Publisher: American Mathematical Society (AMS)
Date: 08-07-2020
DOI: 10.1090/TRAN/8138
Abstract: In this paper we obtain a new fully explicit constant for the Pólya-Vinogradov inequality for squarefree modulus. Given a primitive character χ \chi to squarefree modulus q q , we prove the following upper bound: | ∑ 1 ⩽ n ⩽ N χ ( n ) | ⩽ c q log q , \begin{align*} \left | \sum _{1 \leqslant n\leqslant N} \chi (n) \right |\leqslant c \sqrt {q} \log q, \end{align*} where c = 1 / ( 2 π 2 ) + o ( 1 ) c=1/(2\pi ^2)+o(1) for even characters and c = 1 / ( 4 π ) + o ( 1 ) c=1/(4\pi )+o(1) for odd characters, with an explicit o ( 1 ) o(1) term. This improves a result of Frolenkov and Soundararajan for large q q . We proceed via partial Gaussian sums rather than the usual Montgomery and Vaughan approach of exponential sums with multiplicative coefficients. This allows a power saving on the minor arcs rather than a factor of log q \log {q} as in previous approaches and is an important factor for fully explicit bounds.
Publisher: Canadian Mathematical Society
Date: 02-12-2020
DOI: 10.4153/S0008439520000934
Abstract: In this paper, we obtain a variation of the Pólya–Vinogradov inequality with the sum restricted to a certain height. Assume $\chi $ to be a primitive character modulo q , $ \epsilon $ and $N\le q^{1-\gamma }$ , with $0\le \gamma \le 1/3$ . We prove that $$ \begin{align*} |\sum_{n=1}^N \chi(n) |\le c (\tfrac{1}{3} -\gamma+\epsilon )\sqrt{q}\log q \end{align*} $$ with $c=2/\pi ^2$ if $\chi $ is even and $c=1/\pi $ if $\chi $ is odd. The result is based on the work of Hildebrand and Kerr.
Location: Italy
No related grants have been discovered for Matteo Bordignon.