arXiv (All)
open access
The sum-product phenomenon for dense subsets of finite fields
Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq αp$ for some $α\in (0,1)$, we determine the optimal constant $f(α)$ in the inequality $$ \max(|A+A|, |A\cdot A|) \geq (f(α) - o(1))p. $$ The proof relies on a stru
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Improving bounds for value sets of polynomials over finite fields#1325076
- A near-quadratic lower bound for sets with no unique sums#1233388
- Multiplicative subgroups are not restricted sumsets#1217529
- Arithmetic progressions in dense subsets of primitive elements of finite fields#1077581
- On Polynomial Progressions Inside Sets of Large Dimension#1014536
Record · ID 1341392
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive