Resolving sets and semi-resolving sets in finite projective planes
Tam\'as H\'eger, Marcella Tak\'ats

TL;DR
This paper determines the metric dimension of finite projective planes for large q, characterizes resolving sets, and establishes bounds on semi-resolving sets, including exact sizes for certain q.
Contribution
It provides the exact metric dimension for projective planes of order q ≥ 23 and bounds on semi-resolving sets, including their minimal sizes in specific cases.
Findings
Metric dimension of PG(2,q) is 4q-4 for q ≥ 23.
Minimal semi-resolving set size in PG(2,q) is 2q+2√q for q a square ≥ 9.
Bounds involving double blocking sets are established.
Abstract
We show that the metric dimension of a finite projective plane of order is , and describe all resolving sets of that size. Let denote the size of the smallest double blocking set in , the Desarguesian projective plane of order . We prove that for a semi-resolving set in the incidence graph of , holds. In particular, if is a square, then the smallest semi-resolving set in has size .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
