Search arXivSearch

arXiv · 2603.02111

Horizontal Kakeya maximal operators in finite Heisenberg groups: Exact exponents and applications

Abstract

Let $q$ be an odd prime power. We study Kakeya maximal operators associated with horizontal lines in the finite Heisenberg groups $\mathbb H_n(\mathbb F_q)$. Our principal object is the refined-direction maximal operator, whose parameter records the projective horizontal direction together with the central homogeneous coordinate determined by horizontality. In rank one, we prove \[ \|M_{\mathbb H_1}^{\mathrm{rd}}F\|_{\ell^2(\mathcal D_1)} \lesssim q^{\frac{1}{2}} \|F\|_{\ell^2(\mathbb H_1(\mathbb F_q))}, \] where the exponent $\frac{1}{2}$ is sharp. Combining this estimate with endpoint bounds and interpolation, we determine the exact mixed-norm growth exponent: \[ A^{\mathrm{rd}}_1(u,v) = \max\left\{ \frac1v,\, 1-\frac1u,\, \frac2v-\frac1u,\, 1+\frac2v-\frac3u \right\}, \qquad 1\le u,v\le\infty. \] As a consequence, if $E\subset\mathbb H_1(\mathbb F_q)$ meets, in at least $m$ points, a horizontal line in each refined direction from $Ω\subset D_1$, then \[ |E|\gtrsim \frac{m^2|Ω|}{q}. \] As a benchmark, we also analyze the coarser operator parameterized only by projective horizontal directions and determine its exact $\ell^u\to\ell^v$ growth exponent in every rank. In rank one, this benchmark is established by a self-contained $TT^*$ argument rather than polynomial vanishing, and the same planar estimate reappears as the zero-central-frequency component of the refined-direction proof. The nonzero central frequencies are controlled by Plancherel, character orthogonality, and a bounded-fiber property of an explicit quadratic map. Thus, the sharp refined-direction estimate is obtained by purely Fourier-analytic methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thang Pham, Andrea Pinamonti, Dung The Tran, Boqing Xue. 2026-07-01. Horizontal Kakeya maximal operators in finite Heisenberg groups: Exact exponents and applications. https://arxiv.org/abs/2603.02111

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO