Metraipolis › archive › dc_3baace567f80

The Outer Multiset Dimension of Toroidal Grids — arXiv:2609.20073

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.20073
License (as archived)
CC0-1.0
Archived
2026-10-10T04:47:09.865Z
SHA-256 of the archived text
3740d7121efcb763dfcd0e44032d2f61a38d0f6c3a0aa5686646d7d6d8a01bf2
Stable URL of this page
https://metraipolis.com/documento/dc_3baace567f80

How to cite

The Outer Multiset Dimension of Toroidal Grids — arXiv:2609.20073 — arXiv (en), https://arxiv.org/abs/2609.20073 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3baace567f80 (Metraipolis archive dc_3baace567f80, sha256 3740d7121efcb763dfcd0e44032d2f61a38d0f6c3a0aa5686646d7d6d8a01bf2)
BibTeX
@misc{dc3baace567f80,
  title = {The Outer Multiset Dimension of Toroidal Grids — arXiv:2609.20073},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.20073},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3baace567f80; sha256 3740d7121efcb763dfcd0e44032d2f61a38d0f6c3a0aa5686646d7d6d8a01bf2},
  year = {2026}
}

Archived text

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

Let $S$ be a set of vertices in a connected graph $G$. A vertex outside $S$ is represented by the multiset of its distances to the vertices of $S$. The outer multiset dimension $\operatorname{odim}(G)$ is the minimum cardinality of an $S$ for which these representations distinguish all vertices outside $S$. We determine $\operatorname{odim}(C_s \square C_t)$ for all $s,t\geq 3$, answering a problem of Klavžar, Kuziak, and Yero. The values range from $3$ to $8$. The proof combines a half-turn argument giving a universal four-landmark lower bound when both factors have length at least four, explicit three- and four-landmark constructions for the infinite families, and exact finite enumeration on the remaining strip. The collision classification behind the infinite four-landmark construction is certified by exact quantifier elimination in linear integer arithmetic; source code and all finite upper certificates accompany the paper.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.20073 — 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-10T04:15:33.136Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).