Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2503.15072

Exceptional projections in finite fields: Fourier analytic bounds and incidence geometry

Jonathan M. Fraser·Firdavs Rakhmonov
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider the problem of bounding the number of exceptional projections (projections which are smaller than typical) of a subset of a vector space over a finite field onto subspaces. We establish bounds that depend on $L^p$ estimates for the Fourier transform, improving various known bounds for sets with sufficiently good Fourier analytic properties. The special case $p=2$ recovers a recent result of Bright and Gan (following Chen), which established the finite field analogue of Peres--Schlag's bounds from the continuous setting. We prove several auxiliary results of independent interest, including a character sum identity for subspaces (solving a problem of Chen) and a full generalization of Plancherel's theorem for subspaces. These auxiliary results also have applications in affine incidence geometry, that is, the problem of estimating the number of incidences between a set of points and a set of affine $k$-planes. We present a novel and direct proof of a well-known result in this area that avoids the use of spectral graph theory, and we provide simple examples demonstrating that these estimates are sharp up to constants.

Explore related subjects

math.COmath.CA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonathan M. Fraser, Firdavs Rakhmonov. 2025-04-23. Exceptional projections in finite fields: Fourier analytic bounds and incidence geometry. https://arxiv.org/abs/2503.15072

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

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗