Search arXivSearch

arXiv · 2510.05522

Restricted projections in positive characteristic via Fourier extension and restriction estimates

Abstract

Let $d\ge3$ and $\mathbb{F}_q^{\,d}$ be the $d$-dimensional vector space over a finite field of order $q$, where $q$ is an odd prime power. Let $X_π$ be the set of lines through the origin intersecting the slice $π\cap S^{d-1}$, where $π=\{x_d=λ\}$ and $S^{d-1}=\{x:\|x\|=1\}$. For $E\subset\mathbb{F}_q^{\,d}$ and $N\ge1$, we study the exceptional sets \[ T_1(X_π,E,N)=\bigl\{V\in X_π:\ |π_V(E)|\le N\bigr\},\qquad T_2(X_π,E,N)=\bigl\{V\in X_π:\ |π_{V^\perp}(E)|\le N\bigr\}, \] with their respective natural ranges of $N$. Using discrete Fourier analysis together with restriction/extension estimates for cone and sphere-type quadrics over finite fields, we obtain sharp upper bounds (up to constant factors) for $\lvert T_1\rvert$ and $\lvert T_2\rvert$, with separate analyses for the cases $λ\in \{0, \pm 1\}$. The bounds exhibit arithmetic-geometric dichotomies absent in the full Grassmannian: the quadratic character of $λ^{2}-1$ and the parity of $d$ determine the size of the exceptional sets. As an application, when $|E|\ge q$, there exists a positive proportion of elements $\mathbf{y}\in π\cap S^{d-1}$ such that the pinned dot-product sets $\{\mathbf{y}\cdot \mathbf{x}\colon \mathbf{x}\in E\}$ have cardinality $Ω(q)$. We further study analogous families arising from the spheres of radii $0$ and $-1$, and, by combining the results, recover the known estimates for projections over the full Grassmannian, complementing a result of Chen (2018).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Le Quang Ham, Do Trong Hoang, Le Quang Hung, Doowon Koh, Thang Pham. 2025-12-11. Restricted projections in positive characteristic via Fourier extension and restriction estimates. https://arxiv.org/abs/2510.05522

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

A graph $G$ is {\em perfectly divisible} if, for every induced subgraph $H$ of $G$, $V(H)$ can be partitioned into $A$ and $B$ such that $H[A]$ is perfect and $ω(H[B])<ω(H)$. Chudnovsky and Sivaraman [J. Graph Theory \textbf{90} (2019) 54-60] proved that every ($P_5$, bull)-free graph is perfectly divisible, while Chen and Xu [Discrete Appl. Math. \textbf{372} (2025) 298-307] proved the same for ($P_7,C_5$, bull)-free graphs. We extend these results by proving that every ($P_8,C_5$, bull)-free graph is perfectly divisible and that, letting $F$ denote the Grötzsch graph, a ($P_6$, bull)-free graph is perfectly divisible if and only if it is $F$-free.

math.CO

Covering graphs by isometric trees

A connected subgraph of a graph is isometric if it preserves distances. Recently, graphs admitting a vertex or edge covering by a small number of isometric paths have been studied. In this paper, we consider the analogous problem for isometric trees, focusing on the treewidth of graphs admitting a vertex or edge covering by a small number of such trees. Baste, De Meyer, Giocanti, Objois, and Picavet showed that for coverings by two isometric trees, the treewidth is bounded. We show that already for three isometric trees, the treewidth can be linear in the number of vertices. On the positive side, we show that for graphs of bounded degree coverable by a small number of isometric trees, the treewidth is sublinear in the number of vertices.

math.CO

Tree-independence number of $P_5$-free graphs with no large bicliques

The tree-independence number of a graph is the minimum, over all tree-decompositions of the graph, of the maximum size of an independent set contained in a bag. Graph classes of bounded tree-independence number have strong structural and algorithmic properties; however, the parameter can be unbounded even in quite restricted classes. In particular, the presence of an induced biclique $K_{\ell,\ell}$ forces tree-independence number at least $\ell$. This leads to the question whether large induced bicliques are the only obstruction to bounded tree-independence number in natural hereditary classes. A conjecture of Dallard, Krnc, Kwon, Milanič, Munaro, Štorgel, and Wiederrecht states that for all positive integers $t$ and $\ell$, ${\{P_t,K_{\ell,\ell}\}}$-free graphs have bounded tree-independence number. We prove this conjecture for ${t=5}$ by showing that every ${\{P_5,K_{\ell,\ell}\}}$-free graph has tree-independence number at most ${4\ell-4}$. We also obtain related bounds for the weaker parameter of $α$-degeneracy and answer a question of Hilaire, Milanič, and Vasić whether tree-independence number of ${\{P_5,K_{\ell,\ell}\}}$-free graphs exceeds $\ell$ by at most an additive constant.

math.CO