Published November 11, 2026 | Version 2.0.0

Density bounds for identifying codes in the hexagonal and truncated trihexagonal grids

Authors/Creators

  • 1. Universion Closure Logic

Description

This record brings together the paper and verification materials for identifying-code density bounds on two infinite grids. For the hexagonal grid, the lower bound is 1427623/3410330 = 18/43 + 1/79310. For the truncated trihexagonal grid, the unrestricted density lies between 1829/4263 and 45/104; the upper endpoint is proved optimal in two specified restricted classes. The exact unrestricted densities remain open.

Version 2.0.0 consolidates the former H and T verification materials with the combined manuscript. Mathematical results are unchanged; archive references and the AI disclosure have been updated.

Download the PDF to read the paper. Extract HT_Verification_v2.zip and open START_HERE.html for an offline guide and full replay instructions. The programs verify finite premises; the paper supplies the analytic implications for infinite configurations.

Verification materials: UCL Research Verification Terms 1.0 (RIGHTS.txt). Paper rights: PAPER_RIGHTS.txt. No Creative Commons license is granted.

Files

HT_Identifying_Codes.pdf

Files (5.9 MB)

Name Size
md5:709eb79bbd53c1d5dc2b140116ad1284
406.8 kB Preview Download
md5:03233df6e12cfc66fe96494cecd1eee8
5.4 MB Preview Download