Metraipolis › archive › dc_3ba0f18513ef
Default-Distance Entropy and Metric Dimension in Finite Geometries — arXiv:2608.27788
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.27788
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T11:22:59.326Z
- SHA-256 of the archived text
8eb1e8ce319cefefecca23ad853898a7516cd16df3f6f2498d137d5bfc094cab- Stable URL of this page
https://metraipolis.com/documento/dc_3ba0f18513ef
How to cite
Default-Distance Entropy and Metric Dimension in Finite Geometries — arXiv:2608.27788 — arXiv (en), https://arxiv.org/abs/2608.27788 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3ba0f18513ef (Metraipolis archive dc_3ba0f18513ef, sha256 8eb1e8ce319cefefecca23ad853898a7516cd16df3f6f2498d137d5bfc094cab)
BibTeX
@misc{dc3ba0f18513ef,
title = {Default-Distance Entropy and Metric Dimension in Finite Geometries — arXiv:2608.27788},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.27788},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3ba0f18513ef; sha256 8eb1e8ce319cefefecca23ad853898a7516cd16df3f6f2498d137d5bfc094cab},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27788. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A resolving set in a graph is a set of landmarks whose distance vectors distinguish all vertices. We use information theory to prove lower bounds for metric dimension and class dimension in distance-regular graphs and association schemes arising from finite geometry. The core idea is that, for a fixed landmark, a random object usually lies in one overwhelmingly likely distance or relation class. For classical dual polar graphs, with rank and type fixed and $q\to\infty$ through the admissible field orders, we prove $\mu(\Gamma(q,d,e))=\Theta_{d,e}(q^e)$ for $d\geq 2$ and $e>0$. The lower bound uses opposition as the typical distance. For the upper bound, we take, for each of a constant number of $(d-1)$-dimensional singular subspaces, all generators containing it. For Grassmann graphs, bilinear forms graphs, and attenuated-space schemes, we obtain lower bounds of the same exponential order as the known incidence constructions.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-31 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.27788 — 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-17T11:06:51.762Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).