{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:01:44Z","timestamp":1769155304892,"version":"3.49.0"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We study resolving sets and split resolving sets of the point-block incidence graphs of symmetric designs and we obtain general lower bounds on their cardinality. In some cases, this lower bound is just a constant factor away from the known upper bounds. In particular, we show that for any $\\varepsilon&gt;0$ there exists $q_0$ and $n_0$ such that if $q\\geq q_0$ and $n\\geq n_0$, then the metric dimension of the point-hyperplane incidence graph of $\\mathrm{PG}(n,q)$ is at least $(2-\\varepsilon)nq$. The best known upper bound for the metric dimension of $\\mathrm{PG}(n,q)$ is roughly $4nq$. We also prove that the metric dimension of a symmetric $(v,k,\\lambda)$ design, under certain conditions, is at least $\\frac{(2-\\varepsilon)uv}k$ for any $\\varepsilon &gt;0$, where $u=\\left\\lfloor\\frac{\\ln v}{\\ln v - \\ln k +1}\\right\\rfloor$.<\/jats:p>","DOI":"10.37236\/14106","type":"journal-article","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:52:37Z","timestamp":1769100757000},"source":"Crossref","is-referenced-by-count":0,"title":["Resolving Sets and Split Resolving Sets of Symmetric Designs"],"prefix":"10.37236","volume":"33","author":[{"given":"\u00c1kos","family":"Beke","sequence":"first","affiliation":[]}],"member":"23455","published-online":{"date-parts":[[2026,1,23]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p13\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v33i1p13\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T16:52:38Z","timestamp":1769100758000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v33i1p13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,23]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/14106","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,23]]},"article-number":"P1.13"}}