{"paper":{"title":"$L^p$ averages of the Fourier transform in finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CA"],"primary_cat":"math.CO","authors_text":"Jonathan M. Fraser","submitted_at":"2024-07-11T15:13:15Z","abstract_excerpt":"The Fourier transform plays a central role in many geometric and combinatorial problems cast in vector spaces over finite fields. If a set admits optimal $L^\\infty$ bounds on its Fourier transform (that is, it is a Salem set), then it can often be analysed more easily. However, in many cases obtaining good \\emph{uniform} bounds is not possible, even if `most' points admit good pointwise bounds. Motivated by this, we propose a framework where one systematically studies the $L^p$ averages of the Fourier transform and keeps track of how good the $L^p$ bounds are as a function of $p$. This capture"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.08589","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2407.08589/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}