arXiv (OAI Expanded)
open access
Prime Solutions to a Binary Additive Equation and Mixed Moments of Character Sums
We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box that satisfy the determinant equation $x_1x_2-x_3x_4 =r$ for $r \neq 0 $ with two of entries to be prime. Finally, these estimates are applied to evaluate mixed fourth momen
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
- Nombres de Pisot, nombres de Salem et la conjecture de Lehmer#1144733
- Parity-Sensitive Fourier Uncertainty and Zero-Set Rigidity on the Finite Parabola#1110426
- Moment obstructions and continuum-to-discrete bounds for checkerboard no-three-in-line sets#1000297
- Product representations of polynomials over finite fields#1063833
- List Decoding, Linear Hashing, and Furstenberg over $\mathbb{F}_q$#1123425
Record · ID 1108908
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