3 papers
math.CO2026
The crossing number and the unit-distance crossing number of the Hamming graphs H(d,3)=K_3^{box d}, and their realizations over many coordinate fields
Haroldo Costa Silva Filho
The Hamming graph H(d,3)=K_3^{box d} (n=3^d vertices) is the graph of single-symbol errors of ternary codes, yet we ask a geometric question of it: can it be drawn in the plane wit…
math.MG2026
Origametry and antagonistic heptagon graphs: the braced {35,1} and the complete {21,2}
Haroldo Costa Silva Filho
We study two planar unit-distance graphs (UDGs) that both look like heptagons but have opposite rigidity yet kindred arithmetic: the braced heptagon {35,1} (19 vertices, 35 edges)…
math.CO2026
Exact certification of the coordinate fields of the triangle-free Exoo-Ismailescu unit-distance graphs EI17 and EI19 (HoG 51375, 51376): a solvable-non-solvable dichotomy (origami vs. S20) and the Laman-number conjecture
Haroldo Costa Silva Filho
We certify, exactly, the coordinate fields of a faithful planar realization of two neighbouring triangle-free Exoo-Ismailescu unit-distance graphs (UDGs), and show they realize the…