arXiv (All)
open access
Density one for lattice point visibility along polynomials with at least two distinct roots
We prove that every nonzero integer polynomial with at least two distinct complex roots has lattice point visibility density one, resolving the generalized form of the Visibility Density Conjecture for nonzero polynomials. This extends the origin-passing case established by Chaubey, Pandey, and Rega
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
- Equidistribution of small points over finitely generated fields#984618
- Module Lattice Security (Part IV): Probabilistic Polynomial Quantum Attack on Module-LWE over 2-Power Cyclotomics#200404
- The large sieve for square moduli under Hooley's hypothesis $R^*$#1035161
- Arithmetic probability measures#926802
- Subconvexity of Short $k$-Free Exponential Sums in $\mathbb{F}_q[t]$#818984
Record · ID 996959
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