Holes and Islands of Visible Points on the Triangular Lattice: Midpoint Bond Graphs and Prime-Sieve Bounds

A mix of human-written and AI-generated textHuman understanding: some partsmath.NT — Number Theorymath.AT — Algebraic Topologymath.CO — Combinatorics

Contributed by Sabah Noori Jihad ↗

Version 1 / Nov 21, 2026 / CC BY 4.0

Abstract

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 hh is a local Euler-product term plus the island density b0b_0: h=3J2−2J3−J1+b0h=3J_2-2J_3-J_1+b_0, with Jj=∏p(1−j/p2)J_j=\prod_p(1-j/p^2). 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 0.10917978<h<0.109232250.10917978<h<0.10923225. A separate length-six finite-path CRT method gives h>0.10914952h>0.10914952, 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.

Provenance statement

This research originated from mathematical questions and geometric research directions developed by the human author, Sabah Noori Jihad. AI systems, including ChatGPT, Claude, Gemini, and GitHub Copilot, were extensively used for mathematical exploration, conjecture formulation, proof development, computational experimentation, verification assistance, and manuscript preparation. The work includes computer-assisted numerical certificates and accompanying reproducibility materials. Computational testing and AI-assisted checking should not be interpreted as independent human verification of every mathematical argument. The manuscript is submitted as an AI-assisted mathematical preprint, without formal peer review. The human author assumes responsibility for the submission and acknowledges the need for further independent mathematical assessment.

Tools used

OpenAI
ChatGPT
Anthropic
Claude Fable
Google
Gemini
GitHub
GitHub Copilot

References

  1. S. N. Jihad, The Generative Arithmetic Fabric: A Unified Geometric Workbench for Arithmetic and Generator Deformation , preprint v2.1, October 2026, Zenodo. https://doi.org/10.5281/zenodo.23126296.DOI
  2. M. Kahle, Topology of random simplicial complexes: a survey , Contemporary Mathematics 620 (2014), 201--222. https://arxiv.org/abs/1301.7165v2.link
  3. M. Baake, R. V. Moody and P. A. B. Pleasants, Diffraction from visible lattice points and kk-th power free integers , Discrete Math. 221 (2000), 3--42. https://arxiv.org/abs/math/9906132v2.link
  4. P. A. B. Pleasants and C. Huck, Entropy and diffraction of the kk-free points in nn-dimensional lattices , Discrete Comput. Geom. 50 (2013), 39--68. https://arxiv.org/abs/1112.1629v3.link
  5. S. Le Fourn, M. Liu and S. Martineau, Percolative properties of the random coprime colouring , preprint (2025), arXiv:2509.08452v1. https://arxiv.org/abs/2509.08452v1.arXiv
  6. F. Cellarosi, Density of large holes among power-free lattice points , preprint (2026), arXiv:2609.25457v2. https://arxiv.org/abs/2609.25457v2.arXiv
  7. A. Hatcher, Algebraic Topology , Cambridge University Press, 2002, Section 3.3, Corollary 3.45, p. 255. https://pi.math.cornell.edu/~hatcher/AT/ATpage.html.link

Version history

  1. v1 · 14 pagesSubmitted by Sabah nooriInitial depositCurrentNov 21, 2026