F_p is locally like C
From MaRDI portal
Abstract: Vu, Wood and Wood showed that any finite set S in a characteristic zero integral domain can be mapped to F_p, for infinitely many primes p, while preserving finitely many algebraic incidences of S. In this note we show that the converse essentially holds, namely any small subset of F_p can be mapped to some finite algebraic extension of Q, while preserving bounded algebraic relations. This answers a question of Vu, Wood and Wood. We give several applications, in particular we show that for small subsets of F_p, the Szemer'edi-Trotter theorem holds with optimal exponent 4/3, and we improve the previously best-known sum-product estimate in F_p. We also give an application to an old question of R'enyi. The proof of the main result is an application of elimination theory and is similar in spirit with the proof of the quantitative Hilbert Nullstellensatz.
Recommendations
Cites work
- A slight improvement to Garaev's sum product estimate
- A sum-product estimate in algebraic division algebras
- A sum-product estimate in finite fields, and applications
- Algorithms in real algebraic geometry
- An explicit incidence theorem in F_p
- An Explicit Sum-Product Estimate in Fp
- An improved sum-product inequality in fields of prime order
- An incidence theorem in higher dimensions
- Bounding multiplicative energy by the sumset
- Factorization in generalized arithmetic progressions and application to the Erdős-Szemerédi sum-product problems
- scientific article; zbMATH DE number 3468700 (Why is no real title available?)
- scientific article; zbMATH DE number 3057429 (Why is no real title available?)
- Mapping incidences
- On a variant of sum-product estimates and explicit exponential sum bounds in prime fields
- On Euclid's Algorithm and the Theory of Subresultants
- On new sum-product-type estimates
- On sums and products of integers
- ON THE NUMBER OF SUMS AND PRODUCTS
- On the number of terms of a power of a polynomial
- On the number of terms of a power of a polynomial
- Polynomial Remainder Sequences and Determinants
- Polynomials whose powers are sparse
- Rectification principles in additive number theory
- SETS WITH SMALL SUMSET AND RECTIFICATION
- Sharp estimates for the arithmetic Nullstellensatz
- Slightly improved sum-product estimates in fields of prime order
- Subresultants and Reduced Polynomial Remainder Sequences
- Sums and products from a finite set of real numbers
Cited in
(12)- A point-conic incidence bound and applications over \(\mathbb{F}_p\)
- Beck's theorem for plane curves
- The minrank of random graphs over arbitrary fields
- Incidence bounds for block designs
- Mapping incidences
- Finite field models in additive combinatorics
- A note on projective norm graphs
- Incidences between planes over finite fields
- An effective local-global principle and additive combinatorics in finite fields
- A point-variety incidence theorem over finite fields, and its applications
- Point-polynomial incidences theorem with an application to Reed-Solomon codes
- Condensation and densification for sets of large diameter
This page was built for publication: \(\mathbb F_p\) is locally like \(\mathbb C\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494400)
