Metraipolis › archive › dc_d472d0134692

Optimal $(1,\le \ell)$-locating-dominating codes in infinite triangular grid — arXiv:2610.03227

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.03227
License (as archived)
CC0-1.0
Archived
2026-10-06T08:25:08.523Z
SHA-256 of the archived text
abce4670089bf64cf566b7ed305a3322dd67ff5d521888dbbdaf1555f8f89480
Stable URL of this page
https://metraipolis.com/documento/dc_d472d0134692

How to cite

Optimal $(1,\le \ell)$-locating-dominating codes in infinite triangular grid — arXiv:2610.03227 — arXiv (en), https://arxiv.org/abs/2610.03227 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d472d0134692 (Metraipolis archive dc_d472d0134692, sha256 abce4670089bf64cf566b7ed305a3322dd67ff5d521888dbbdaf1555f8f89480)
BibTeX
@misc{dcd472d0134692,
  title = {Optimal $(1,le ell)$-locating-dominating codes in infinite triangular grid — arXiv:2610.03227},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.03227},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d472d0134692; sha256 abce4670089bf64cf566b7ed305a3322dd67ff5d521888dbbdaf1555f8f89480},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.03227. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study two variants of location-domination in infinite triangular grids which allow locating up to $\ell$ vertices simultaneously. A locating-dominating code $S$ is a dominating vertex set such that every vertex outside of it has a unique neighborhood within the code $S$. As this neighborhood is unique, we may use it as an identifier for locating the considered vertex outside of the vertex set. With the variants we study, we may also locate sets of vertices instead of only single vertices. In particular, we obtain the exact minimum densities of these types of sets in the infinite triangular grid for every value of $\ell$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-05 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.03227 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T08:18:48.305Z dalla pagina https://arxiv.org/catchup/math.CO/2026-10-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).