Logo image
Verification data and code for "A 32-leaf tree requiring six coordinates for an isometric ℓ∞ embedding"
Dataset   Open access

Verification data and code for "A 32-leaf tree requiring six coordinates for an isometric ℓ∞ embedding"

Logan R. Chalmers
Zenodo
16/08/2026
Handle:
https://hdl.handle.net/10523/52364

Abstract

Ancillary material for the paper "A 32-leaf tree requiring six coordinates for an isometric ℓ∞ embedding." The deposit contains the explicit 32-leaf tree, a six-orientation cover, the induced integer embedding, an exact exclusion of five-orientation covers, and census records and verification procedures establishing that the leaf bound holds through 31 leaves and first fails at 32. Two Jupyter notebooks reproduce the principal checks.
url
https://doi.org/10.5281/zenodo.21965425View
Replication Package Open CC BY V4.0

Metrics

1 Record Views

Details

Logo image