🔢 mathematics

Visibility of Lattice Points across Polynomials

This paper generalizes the study of lattice point visibility from the origin along straight lines and monomial curves to polynomial families by establishing a new polynomial GCD criterion for lower bounds, deriving exact inclusion-exclusion formulas for visible point counts, and exploring related open questions on gap distributions and quantitative bounds.

Original authors: Chahat Ahuja

Published 2026-01-26

📖 5 min read🧠 Deep dive

CC BY 4.0

Original authors: Chahat Ahuja

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a vast, infinite grid of dots stretching out in every direction, like a giant sheet of graph paper. In mathematics, these are called lattice points.

For over a century, mathematicians have asked a simple question: If you stand at the very center of this grid (the origin, or point 0,0), which other dots can you "see" directly?

In the old, classic version of this game, you can only look in straight lines. A dot is "visible" if no other dot is blocking your view along that straight line. If a dot is hidden behind another one, it's "invisible." It turns out that about 60% of all dots are visible, and about 40% are hidden.

The New Game: Curved Lines
This paper, written by Chahat Ahuja, asks: What happens if we don't just look in straight lines? What if we look along curved paths defined by polynomials (mathematical formulas like $y = x^2$ or $y = 2x^3 + 5x$ )?

Imagine instead of a laser beam, you are shining a flexible, rubbery hose that can bend into specific shapes. The paper explores what happens when you try to see a dot along these curved hoses.

Here is a breakdown of the paper's main ideas using simple analogies:

1. The "Tailor-Made" Curve (The Easy Part)

First, the author shows that if you pick any specific dot you want to see, you can always invent a custom curve that goes exactly through that dot and no other dots in between.

The Analogy: Imagine you want to see a specific friend standing in a crowd. You can't just use a straight laser because someone might be in the way. But, if you are allowed to bend your laser into a weird, custom shape, you can always find a path that snakes around everyone else and hits your friend directly.
The Catch: The paper admits this is a bit "artificial." It's like building a custom-made tunnel just for one person. It proves it's possible, but it doesn't tell us what happens in the real world where the curves are fixed and natural.

2. The "Fixed Family" of Curves (The Hard Part)

The real meat of the paper looks at families of curves that are already defined, like $y = x^2$ or $y = x^3 + x$ . The question is: If we use these standard curves, which dots are visible, and how many are there?

The "GCD" Rule: In the straight-line version, a dot is visible if the numbers in its coordinates don't share a common factor (like 2 and 4 share a 2, so they are hidden; 3 and 5 don't, so they are visible).
The New Rule: The author creates a new "visibility test" for these curves. Instead of just checking if numbers share a factor, you have to check a specific relationship between the dot's position and the curve's formula. If the math works out just right, the dot is visible. If not, it's hidden behind a "mathematical wall."

3. Counting the Visible Dots

The paper tries to answer: "If I look at a huge square area of the grid, what percentage of dots can I see along these curves?"

The Formula: The author derives a complex formula (involving something called the "Riemann zeta function" and prime numbers) to estimate this percentage.
The Result: Just like with straight lines, there is a predictable density. You can calculate roughly how many dots will be visible for any given polynomial curve.

4. The "Hidden Forests" (Computational Experiment)

This is the most visual part of the paper. The author wrote a computer program to look for "blocks" of invisible dots.

The Analogy: Imagine walking through a forest. Most of the time, you see trees (dots) clearly. But sometimes, you might find a small, dense patch where you can't see anything because the trees are packed so tightly together.
The Discovery: The computer found that invisible dots often cluster together. The author successfully found 2x2 blocks of invisible dots for many different polynomial curves. It's like finding a little "blind spot" in the grid where four dots are all hiding behind each other at the same time.
The Limit: The computer could only search a grid of 1,000 by 1,000 dots. For some curves, the "blind spots" were found quickly; for others with steeper curves, the blind spots were so far away the computer couldn't find them within the time limit.

Summary

In short, this paper takes a classic math puzzle about "seeing dots on a grid" and bends it.

It proves you can always see a dot if you bend the path enough (but that's a trivial trick).
It figures out the rules for seeing dots along standard curved paths.
It calculates how many dots are visible on average.
It uses a computer to find small "islands" of invisibility where dots hide in groups.

The paper concludes by suggesting that while we know the rules for 2x2 blocks, we don't yet know the full story about larger blocks or how these patterns behave in the long run. It's an invitation to keep exploring the hidden geometry of the number grid.

Technical Summary: Visibility of Lattice Points Across Polynomials

Problem Statement
The paper addresses the generalization of the classical problem of lattice point visibility from the origin. Traditionally, a point $(a, b) \in \mathbb{Z}^2$ is visible if the line segment connecting it to the origin contains no other integer points, a condition equivalent to $\gcd(a, b) = 1$ . The density of such visible points in $\mathbb{Z}^2$ is known to be $1/\zeta(2)$ . Previous generalizations extended this to monomial curves $y = ax^b$ , where the density of visible points is $1/\zeta(b+1)$ .

This work extends the framework to families of polynomial curves defined by:
$F(a_n, \dots, a_1) = \{ y = q(a_n x^n + \dots + a_1 x) \mid q \in \mathbb{Q}^+ \}$
where coefficients are non-negative integers with $\gcd(a_n, \dots, a_1) = 1$ . The central problem is to determine the conditions under which a lattice point $(r, s)$ is "visible" along a curve in this family (i.e., no other integer point lies on the curve segment between the origin and $(r, s)$ ) and to analyze the density and distribution of such points.

Methodology
The paper employs a combination of number-theoretic analysis, constructive proofs, and computational experimentation:

Constructive Existence (Point-to-Polynomial): The authors first explore the converse problem: given a specific point $(a, b)$ , can a polynomial be constructed such that the point is visible? Using base- $a$ expansions of large primes $\ell > \max(a, b)$ , they construct specific polynomials where $(a, b)$ is the first integer point on the curve. This demonstrates that visibility can always be engineered for any point, though such constructions are highly specific and artificial.
Polynomial-to-Point Analysis: The core theoretical work focuses on fixed polynomial families. The authors define a "polynomial-gcd" condition:
$\gcd_P(a, b) = \max \{ d \in \mathbb{N} : d \mid P(a) \text{ and } d \mid b \}$
They establish that if $\gcd_P(a, b) = 1$ , the point is visible.
Density Estimation: To estimate the density of visible points, the authors utilize the Principle of Inclusion-Exclusion. They define a least common multiple term $L_P(a)$ based on the ratios $P(a)/\gcd(P(a), P(t))$ for $t < a$ . A point $(a, b)$ is visible if $\gcd(b, L_P(a)) = 1$ .
Computational Exploration: The paper investigates the local clustering of invisible points (blocks of non-visible points). Using a Breadth-First Search (BFS) algorithm implemented in Python, the authors search for $n \times n$ blocks of invisible points within quadratic families $f(x) = Ax^2 + Bx$ on a $1000 \times 1000$ grid.

Key Contributions and Results

Visibility Criterion: The paper proposes a novel criterion for visibility based on the polynomial-gcd condition. Specifically, Lemma 3.2 states that if $\gcd_P(a, b) = 1$ , then $(a, b)$ is $F$ -visible.
Lower Bounds for Density: Theorem 3.7 provides an asymptotic formula for the number of visible points $E_P(N)$ up to $N$ :
$E_P(N) = C_P N^2 + O(N \log N)$
where the constant $C_P = \prod_p (1 - \rho_P(p)/p^2)$ depends on the number of roots $\rho_P(p)$ of the polynomial modulo $p$ . This refines previous bounds by incorporating the root structure of the polynomial modulo all primes.
Exact Double-Sum Formula: Theorem 3.8 derives an exact double-sum formula using the Principle of Inclusion-Exclusion to count the number of visible pairs $(a, b)$ for specific quadratic forms $y = q(sx^2 + rx)$ .
Corollary on Density: Corollary 3.10 asserts that for the general polynomial family defined, the density of visible points is 1, citing the work of Chaubey and Pandey [1] for the proof.
Computational Findings: The computational study successfully identified $2 \times 2$ blocks of invisible points for 15 specific quadratic polynomials within the $1000 \times 1000$ search space. The results indicate that invisible points can form contiguous clusters (blocks) rather than appearing uniformly scattered. The study notes that polynomials with higher coefficients tend to push these invisible blocks further from the origin.

Significance and Scope
The paper claims to provide a "more robust theoretical foundation" for understanding lattice point visibility in non-linear settings, moving beyond linear or monomial relationships. By establishing a polynomial-gcd condition and deriving exact counting formulas, the work bridges classical number theory with the geometry of polynomial curves.

The authors explicitly frame their contribution as establishing structural results, density estimates, and constructive examples. They conclude by posing open questions regarding gap distributions and quantitative bounds for non-visible points, suggesting that the observed clustering of invisible points warrants further investigation into polynomial analogues of the "hidden forest" problem. The paper does not claim to solve the general density problem for all polynomial families but rather provides specific criteria and bounds for the defined families, acknowledging that the constructed polynomials for point-to-point visibility are "somewhat artificial" and that the natural structure of visibility patterns in general families remains a subtle and complex area of study.

1. The "Tailor-Made" Curve (The Easy Part)

2. The "Fixed Family" of Curves (The Hard Part)

3. Counting the Visible Dots

4. The "Hidden Forests" (Computational Experiment)

Summary

More like this