<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>article</genre>

<titleInfo><title>On the size of the maximum of incomplete Kloosterman sums</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Dante</namePart>
  <namePart type="family">Bonolis</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">6A459894-5FDD-11E9-AF35-BB24E6697425</identifier></name>







<name type="corporate">
  <namePart></namePart>
  <identifier type="local">TiBr</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">Let t : Fp → C be a complex valued function on Fp. A classical problem in analytic number theory is bounding the maximum M(t) := max 0≤H&lt;p ∣ 1/√p ∑ 0≤n&lt;H t (n) ∣ of the absolute value of the incomplete sums(1/√p)∑0≤n&lt;H t (n). In this very general context one of the most important results is the Pólya–Vinogradov bound M(t)≤IIˆtII∞ log 3p, where ˆt : Fp → C is the normalized Fourier transform of t. In this paper we provide a lower bound for certain incomplete Kloosterman sums, namely we prove that for any ε &gt; 0 there exists a large subset of a ∈ F×p such that for kl a,1,p : x → e((ax+x) / p) we have M(kla,1,p) ≥ (1−ε/√2π + o(1)) log log p, as p→∞. Finally, we prove a result on the growth of the moments of {M (kla,1,p)}a∈F×p. 2020 Mathematics Subject Classification: 11L03, 11T23 (Primary); 14F20, 60F10 (Secondary).</abstract>

<relatedItem type="constituent">
  <location>
    <url displayLabel="2021_MathProcCamPhilSoc_Bonolis.pdf">https://research-explorer.ista.ac.at/download/9364/10395/2021_MathProcCamPhilSoc_Bonolis.pdf</url>
  </location>
  <physicalDescription><internetMediaType>application/pdf</internetMediaType></physicalDescription><accessCondition type="restrictionOnAccess">no</accessCondition>
</relatedItem>
<originInfo><publisher>Cambridge University Press</publisher><dateIssued encoding="w3cdtf">2022</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Mathematical Proceedings of the Cambridge Philosophical Society</title></titleInfo>
  <identifier type="issn">0305-0041</identifier>
  <identifier type="eIssn">1469-8064</identifier>
  <identifier type="arXiv">1811.10563</identifier>
  <identifier type="ISI">000784421500001</identifier><identifier type="doi">10.1017/S030500412100030X</identifier>
<part><detail type="volume"><number>172</number></detail><detail type="issue"><number>3</number></detail><extent unit="pages">563 - 590</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<ama>Bonolis D. On the size of the maximum of incomplete Kloosterman sums. &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;. 2022;172(3):563-590. doi:&lt;a href=&quot;https://doi.org/10.1017/S030500412100030X&quot;&gt;10.1017/S030500412100030X&lt;/a&gt;</ama>
<short>D. Bonolis, Mathematical Proceedings of the Cambridge Philosophical Society 172 (2022) 563–590.</short>
<ista>Bonolis D. 2022. On the size of the maximum of incomplete Kloosterman sums. Mathematical Proceedings of the Cambridge Philosophical Society. 172(3), 563–590.</ista>
<mla>Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;, vol. 172, no. 3, Cambridge University Press, 2022, pp. 563–90, doi:&lt;a href=&quot;https://doi.org/10.1017/S030500412100030X&quot;&gt;10.1017/S030500412100030X&lt;/a&gt;.</mla>
<ieee>D. Bonolis, “On the size of the maximum of incomplete Kloosterman sums,” &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;, vol. 172, no. 3. Cambridge University Press, pp. 563–590, 2022.</ieee>
<apa>Bonolis, D. (2022). On the size of the maximum of incomplete Kloosterman sums. &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;. Cambridge University Press. &lt;a href=&quot;https://doi.org/10.1017/S030500412100030X&quot;&gt;https://doi.org/10.1017/S030500412100030X&lt;/a&gt;</apa>
<chicago>Bonolis, Dante. “On the Size of the Maximum of Incomplete Kloosterman Sums.” &lt;i&gt;Mathematical Proceedings of the Cambridge Philosophical Society&lt;/i&gt;. Cambridge University Press, 2022. &lt;a href=&quot;https://doi.org/10.1017/S030500412100030X&quot;&gt;https://doi.org/10.1017/S030500412100030X&lt;/a&gt;.</chicago>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>9364</recordIdentifier><recordCreationDate encoding="w3cdtf">2021-05-02T22:01:29Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2023-08-02T06:47:48Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
