A Share-Deficit Bound and a 40-Word Local Identifying Code in the 8-Cube

A local identifying code is a dominating set whose intersections with closed neighbourhoods distinguish adjacent vertices. Let M^L(n) be the minimum size of such a code in the binary n-cube. This preprint gives a self-contained share-deficit argument excluding 35-word codes in the 8-cube and an explicit 40-word construction, yielding 36 ≤ M^L(8) ≤ 40. The lower-bound argument classifies the equality cases of a local share estimate and shows that a hypothetical 35-word code would induce a disjoint union of three-vertex paths, contradicting its cardinality. The construction is accompanied by a short exhaustive verifier in the manuscript. These arguments do not depend on the project's SAT lower-bound certificates.This is an AI-assisted preprint draft, not peer reviewed, and it has not undergone independent human mathematical review. No priority claim is made. The interval is not an exact determination of M^L(8).

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-18
DOI
https://doi.org/10.5281/zenodo.24335624
Primary Topic
Graph Labeling and Dimension Problems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Share-Deficit Bound and a 40-Word Local Identifying Code in the 8-Cube

Steven Minh Phat Duong
1 links
Zenodo (CERN European Organization for Nuclear Research)
Graph Labeling and Dimension Problems
preprint

A Share-Deficit Bound and a 40-Word Local Identifying Code in the 8-Cube

Steven Minh Phat Duong
preprint en

Abstract

A local identifying code is a dominating set whose intersections with closed neighbourhoods distinguish adjacent vertices. Let M^L(n) be the minimum size of such a code in the binary n-cube. This preprint gives a self-contained share-deficit argument excluding 35-word codes in the 8-cube and an explicit 40-word construction, yielding 36 ≤ M^L(8) ≤ 40. The lower-bound argument classifies the equality cases of a local share estimate and shows that a hypothetical 35-word code would induce a disjoint union of three-vertex paths, contradicting its cardinality. The construction is accompanied by a short exhaustive verifier in the manuscript. These arguments do not depend on the project's SAT lower-bound certificates.This is an AI-assisted preprint draft, not peer reviewed, and it has not undergone independent human mathematical review. No priority claim is made. The interval is not an exact determination of M^L(8).

Zenodo (CERN European Organization for Nuclear Research)
Graph Labeling and Dimension Problems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon