{"title":"有限域限制问题的双线性方法","authors":"Mark Lewko","doi":"arxiv-2408.03514","DOIUrl":null,"url":null,"abstract":"Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd\ncharacteristic in which $-1$ is not a square. We show that the associated\nFourier extension operator maps $L^2$ to $L^{r}$ for $r > \\frac{24}{7} \\approx\n3.428$. Previously this was known (in the case of prime order fields) for $r >\n\\frac{188}{53} \\approx 3.547$. In contrast with much of the recent progress on\nthis problem, our argument does not use state-of-the-art incidence estimates\nbut rather proceeds by obtaining estimates on a related bilinear operator.\nThese estimates are based on a geometric result that, roughly speaking, states\nthat a set of points in the finite plane $F^2$ can be decomposed as a union of\nsets each of which either contains a controlled number of rectangles or a\ncontrolled number of trapezoids.","PeriodicalId":501145,"journal":{"name":"arXiv - MATH - Classical Analysis and ODEs","volume":"15 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A bilinear approach to the finite field restriction problem\",\"authors\":\"Mark Lewko\",\"doi\":\"arxiv-2408.03514\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd\\ncharacteristic in which $-1$ is not a square. We show that the associated\\nFourier extension operator maps $L^2$ to $L^{r}$ for $r > \\\\frac{24}{7} \\\\approx\\n3.428$. Previously this was known (in the case of prime order fields) for $r >\\n\\\\frac{188}{53} \\\\approx 3.547$. In contrast with much of the recent progress on\\nthis problem, our argument does not use state-of-the-art incidence estimates\\nbut rather proceeds by obtaining estimates on a related bilinear operator.\\nThese estimates are based on a geometric result that, roughly speaking, states\\nthat a set of points in the finite plane $F^2$ can be decomposed as a union of\\nsets each of which either contains a controlled number of rectangles or a\\ncontrolled number of trapezoids.\",\"PeriodicalId\":501145,\"journal\":{\"name\":\"arXiv - MATH - Classical Analysis and ODEs\",\"volume\":\"15 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Classical Analysis and ODEs\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.03514\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Classical Analysis and ODEs","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.03514","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A bilinear approach to the finite field restriction problem
Let $P$ denote the $3$-dimensional paraboloid over a finite field of odd
characteristic in which $-1$ is not a square. We show that the associated
Fourier extension operator maps $L^2$ to $L^{r}$ for $r > \frac{24}{7} \approx
3.428$. Previously this was known (in the case of prime order fields) for $r >
\frac{188}{53} \approx 3.547$. In contrast with much of the recent progress on
this problem, our argument does not use state-of-the-art incidence estimates
but rather proceeds by obtaining estimates on a related bilinear operator.
These estimates are based on a geometric result that, roughly speaking, states
that a set of points in the finite plane $F^2$ can be decomposed as a union of
sets each of which either contains a controlled number of rectangles or a
controlled number of trapezoids.