Density one for lattice point visibility along polynomials with at least two distinct roots
Abstract
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 Regavim. Visibility is taken along the curves y=tF(x) with rational t, with a point visible if no positive lattice point on the same curve has a smaller horizontal coordinate. The proof uses a greatest common divisor cutoff to reduce the problem to finitely many equations of the form F(b)=qF(a), with 0<q<1; for each equation, the positive integers a admitting a positive integer solution b<a form a set of density zero. This elementary argument removes the proper-power hypothesis of earlier work without requiring estimates uniform in the ratio.
Related
- Lattice point visibility along powers of quadratic polynomials
- Local-global principles for visibility of lattice points on parameterized curves
- A lattice path model for Schubert and forest polynomials: positivity and combinatorial interpretations
- Sparse Moore-local realisations of binary irreducible polynomials on near-square lattice regions
- Low-Density Parity-Check Codes of High Girth from Permutation Polynomials
BibTeX
@misc{lobsenz2026density,
title = {{Density one for lattice point visibility along polynomials with at least two distinct roots}},
author = {Abraham Lobsenz},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.06309},
eprint = {2609.06309},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.06309},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Density one for lattice point visibility along polynomials with at least two distinct roots
AU - Abraham Lobsenz
PY - 2026
DA - 2026/09/09
PB - arXiv
DO - 10.48550/arxiv.2609.06309
UR - https://arxiv.org/abs/2609.06309
AB - 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 Regavim. Visibility is taken along the curves y=tF(x) with rational t, with a point visible if no positive lattice point on the same curve has a smaller horizontal coordinate. The proof uses a greatest common divisor cutoff to reduce the problem to finitely many equations of the form F(b)=qF(a), with 0<q<1; for each equation, the positive integers a admitting a positive integer solution b<a form a set of density zero. This elementary argument removes the proper-power hypothesis of earlier work without requiring estimates uniform in the ratio.
ER -