math.NT — Number Theory
Holes and Islands of Visible Points on the Triangular Lattice: Midpoint Bond Graphs and Prime-Sieve Bounds
For the induced complex on primitive integer pairs in a triangular lattice, we identify first homology with interior components of a half-scale midpoint bond graph. Its complementary planar dual has the visible-site graph as its line graph, giving a bijection between finite visible islands and bounded nonsingleton dual faces. In particular the hole density is a local Euler-product term plus the island density : , with . Each odd prime produces a matching, two primes produce a small forest, and diameter exclusion bounds cycle birth. We refine the bounds by retaining the actual earlier prime sieve at each step. A computer-assisted certificate, including a nonnegative coverage recurrence for islands, yields . A separate length-six finite-path CRT method gives , still below the island certificate, and an exact decomposition distinguishes old-component chords from cycles born among new cross-component bonds. Assuming the random-coprime nonpercolation theorem of Le Fourn--Liu--Martineau, the relative cycle increment of a new prime converges to a conditional connection probability. The planar correspondences, density existence, and numerical bounds do not require this probabilistic input.