arXiv (All)
open access
Critical Pairs for Mixed Restricted Sumsets in Prime Fields
Let $p$ be an odd prime and let $A,B\subseteq\mathbb{F}_p$ be nonempty and distinct, with $|A|\ge |B|$. We give a complete classification of the pairs for which the mixed restricted sumset $A\mathbin{\widehat+} B=\{x+y:x\in A,\ y\in B,\ x\ne y\}$ has size $\min\{p,|A|+|B|-2\}$. The main new contribu
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
- The Furstenberg-Sárközy theorem for sums of an even number of odd powers#1122618
- Prime-Detecting Identities from Dirichlet Inversion#1117990
- Diophantine approximation with primes in an arithmetic progression#996808
- Full-radius dimension-free maximal inequalities for discrete Euclidean balls#1070936
- A Kronecker algorithm for locally closed sets over a perfect field#223496
Record · ID 1049086
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