Skip to content
Preprint

Lower bounds for some value sets over finite fields: incidence geometry and Bourgain's group expansion theorem

Sep 2026 · 0 citations · 30 references
Mathematics

Abstract

We develop two transition principles for lower-bounding value sets generated by structured sequences over prime fields. A reciprocal-affine family with $M$ internal transitions and bounded quotient multiplicity has image size $\gg \min{M,p}^{8/15}$. This recovers the factorial-residue bound and yields the same exponent for arithmetic Pochhammer products, Gaussian $q$-factorials, derangement numbers, and the numbers of ordered subsets. A second theorem treats nonzero sequences whose consecutive ratios evolve under a nondegenerate M"obius transformation: their value sets have size $\gg \min{M,p}^{1/2+\eta}$ for an absolute constant $\eta>0$. As consequences, fixed rows of Pascal's triangle and the initial half-blocks of the Catalan and central binomial sequences exceed the square-root scale. The proofs combine transition quotients with, respectively, Cartesian-product point-line incidence geometry and Bourgain's expansion-based incidence theorem in $\mathrm{SL}_2(\mathbb{F}_p)$.

View source

Similar papers

Preprint Sep 2026

A planar algebraic Zarankiewicz theorem over prime fields

We prove an incidence bound for bipartite graphs on finite subsets of $\mathbb{F}^2\times \mathbb{F}^2$ defined by Boolean combinations of polynomial equations of bounded degree. If such a graph is $K_{k,k}$-free and its vertex classes have sizes $m$ and $n$, then it has $O_{t,k}((mn)^{2/3}+m+n+mn/p)$ edges, where $t$...

Le Quang-Ham · 0 citations
Preprint Aug 2026

Exceptional covers of the projective line with genus-one Galois closure: arithmetic forms over finite fields

Let $k=\mathbb F_q$. We classify, up to two-sided $k$-M\"obius equivalence, all separable indecomposable tame exceptional maps $\mathbf P^1_k\to\mathbf P^1_k$ whose geometric Galois closure has genus one. The resulting arithmetic fixed-field forms are encoded by Frobenius-stable affine elliptic quotient data recovered...

Xiang Fan · 1 citation
Preprint Aug 2026

Fixed Convex-Lens Spectral Constants: M\"obius Reduction, Sharp Model Theorems, and Angle-Dependent Bounds

For the intersection of two disks meeting at angle $2\alpha$, let $C(\alpha)$ be the least constant in the associated spectral-set inequality. We give a self-contained M"obius reduction to the corresponding numerical-range problem on a sector and determine the sharp constant for affine square-zero operators $B=\lambda...

Zi-Jian Zeng · 0 citations
Preprint Aug 2026

Products of point counts of higher genus curves over finite fields

Let $E/\mathbb Q$ be an elliptic curve and for each prime $p$, let $N_p$ denote the number of points of $E$ modulo $p$. The original version of the conjecture of Birch and Swinnerton-Dyer asserts that $\prod \limits _{p \leq x} \frac{N_p}{p} \sim C (\log x) ^{\text{rank}(E(\mathbb Q))}$ as $x \to \infty$. In this paper...

A. Bucur, K. Kedlaya, A. Sheth · 0 citations
Preprint Aug 2026

Smale's Mean Value Conjecture and its Dual Conjecture for Complex Polynomials

For the purposes of proving Smale's mean value conjecture, one may restrict consideration to an explicitly described family of so-called Schlicht normalized polynomials. For Schlicht normalized polynomials whose leading coefficient decays sufficiently slowly, we show that the conjectured upper bound $1$ becomes asympto...

Aneesh Jatar, Tu-En-Wai Ng · 0 citations
Preprint Aug 2026

Infinitely many elliptic curves over $\mathbb{Q}(i)$ of exact ranks 4 and 6 with $j$-invariant 1728

For each $r\in\{4,6\}$, we construct an explicit one-parameter family of elliptic curves over $\mathbb{Q}(i)$ containing infinitely many pairwise nonisomorphic curves genuinely defined over $\mathbb{Q}(i)$ with $j$-invariant $1728$ and rank exactly $r$. We construct explicit $\mathbb{Q}(i)$-rational points to bound the...

B. Savoie · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.