Bounds for Kloosterman Sums for $\mathrm{GL}_n
In this paper power saving bounds for general Kloosterman sums for all Weyl elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound by D\k{a}browski and Reeder. This is achieved by representing the sums in an explicit way as exponential sums and bounding these through appli...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Linn, Johannes |
| description | In this paper power saving bounds for general Kloosterman sums for all Weyl
elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound
by D\k{a}browski and Reeder. This is achieved by representing the sums in an
explicit way as exponential sums and bounding these through applications of the
Weil bound. |
| doi_str_mv | 10.48550/arxiv.2412.04976 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_04976</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_04976</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_049763</originalsourceid><addsrcrecordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jMwsTQ342TQc8ovzUspVkjLL1LwzsnPLy5JLcpNzFMILs2FCKrE5CaWZBTlVrv71Mbn8TCwpiXmFKfyQmluBnk31xBnD12wyfEFRZm5iUWV8SAb4sE2GBNWAQDR_y_8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Bounds for Kloosterman Sums for $\mathrm{GL}_n</title><source>arXiv.org</source><creator>Linn, Johannes</creator><creatorcontrib>Linn, Johannes</creatorcontrib><description>In this paper power saving bounds for general Kloosterman sums for all Weyl
elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound
by D\k{a}browski and Reeder. This is achieved by representing the sums in an
explicit way as exponential sums and bounding these through applications of the
Weil bound.</description><identifier>DOI: 10.48550/arxiv.2412.04976</identifier><language>eng</language><subject>Mathematics - Number Theory</subject><creationdate>2024-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2412.04976$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.04976$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Linn, Johannes</creatorcontrib><title>Bounds for Kloosterman Sums for $\mathrm{GL}_n</title><description>In this paper power saving bounds for general Kloosterman sums for all Weyl
elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound
by D\k{a}browski and Reeder. This is achieved by representing the sums in an
explicit way as exponential sums and bounding these through applications of the
Weil bound.</description><subject>Mathematics - Number Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNpjYJA0NNAzsTA1NdBPLKrILNMzMjE00jMwsTQ342TQc8ovzUspVkjLL1LwzsnPLy5JLcpNzFMILs2FCKrE5CaWZBTlVrv71Mbn8TCwpiXmFKfyQmluBnk31xBnD12wyfEFRZm5iUWV8SAb4sE2GBNWAQDR_y_8</recordid><startdate>20241206</startdate><enddate>20241206</enddate><creator>Linn, Johannes</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20241206</creationdate><title>Bounds for Kloosterman Sums for $\mathrm{GL}_n</title><author>Linn, Johannes</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_049763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Number Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Linn, Johannes</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Linn, Johannes</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bounds for Kloosterman Sums for $\mathrm{GL}_n</atitle><date>2024-12-06</date><risdate>2024</risdate><abstract>In this paper power saving bounds for general Kloosterman sums for all Weyl
elements for $\mathrm{GL}_n$ for $n>2$ are proven, improving the trivial bound
by D\k{a}browski and Reeder. This is achieved by representing the sums in an
explicit way as exponential sums and bounding these through applications of the
Weil bound.</abstract><doi>10.48550/arxiv.2412.04976</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2412.04976 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2412_04976 |
| source | arXiv.org |
| subjects | Mathematics - Number Theory |
| title | Bounds for Kloosterman Sums for $\mathrm{GL}_n |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T16%3A59%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Bounds%20for%20Kloosterman%20Sums%20for%20$%5Cmathrm%7BGL%7D_n&rft.au=Linn,%20Johannes&rft.date=2024-12-06&rft_id=info:doi/10.48550/arxiv.2412.04976&rft_dat=%3Carxiv_GOX%3E2412_04976%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |