{"id":"https://openalex.org/W7125404008","doi":"https://doi.org/10.37236/14106","title":"Resolving Sets and Split Resolving Sets of Symmetric Designs","display_name":"Resolving Sets and Split Resolving Sets of Symmetric Designs","publication_year":2026,"publication_date":"2026-01-22","ids":{"openalex":"https://openalex.org/W7125404008","doi":"https://doi.org/10.37236/14106"},"language":null,"primary_location":{"id":"doi:10.37236/14106","is_oa":true,"landing_page_url":"https://doi.org/10.37236/14106","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p13/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p13/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016681946","display_name":"\u00c1kos Beke","orcid":null},"institutions":[{"id":"https://openalex.org/I106118109","display_name":"E\u00f6tv\u00f6s Lor\u00e1nd University","ror":"https://ror.org/01jsq2704","country_code":"HU","type":"education","lineage":["https://openalex.org/I106118109"]}],"countries":["HU"],"is_corresponding":true,"raw_author_name":"\u00c1kos Beke","raw_affiliation_strings":["Department of Mathematics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Savaria University Centre"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, ELTE E\u00f6tv\u00f6s Lor\u00e1nd University, Savaria University Centre","institution_ids":["https://openalex.org/I106118109"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5016681946"],"corresponding_institution_ids":["https://openalex.org/I106118109"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27163129,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"33","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9800000190734863,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.008299999870359898,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10849","display_name":"Finite Group Theory Research","score":0.003000000026077032,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7287999987602234},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6560999751091003},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5803999900817871},{"id":"https://openalex.org/keywords/metric-dimension","display_name":"Metric dimension","score":0.5645999908447266},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4406000077724457},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.39419999718666077}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7807000279426575},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7287999987602234},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6560999751091003},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6107000112533569},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5803999900817871},{"id":"https://openalex.org/C60933471","wikidata":"https://www.wikidata.org/wiki/Q17152964","display_name":"Metric dimension","level":5,"score":0.5645999908447266},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4406000077724457},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42800000309944153},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.39419999718666077},{"id":"https://openalex.org/C198043062","wikidata":"https://www.wikidata.org/wiki/Q180953","display_name":"Metric space","level":2,"score":0.31790000200271606},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C75432250","wikidata":"https://www.wikidata.org/wiki/Q29654355","display_name":"Real line","level":2,"score":0.2703999876976013},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.26269999146461487},{"id":"https://openalex.org/C119322782","wikidata":"https://www.wikidata.org/wiki/Q2662236","display_name":"VC dimension","level":2,"score":0.2597000002861023}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/14106","is_oa":true,"landing_page_url":"https://doi.org/10.37236/14106","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p13/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/14106","is_oa":true,"landing_page_url":"https://doi.org/10.37236/14106","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v33i1p13/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7125404008.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,92],"study":[1],"resolving":[2,6],"sets":[3,7],"and":[4,16,53,60],"split":[5],"of":[8,13,67,72,87,99],"the":[9,38,64,68,84,96],"point-block":[10],"incidence":[11,70],"graphs":[12],"symmetric":[14,101],"designs":[15],"we":[17,44],"obtain":[18],"general":[19],"lower":[20,29],"bounds":[21],"on":[22],"their":[23],"cardinality.":[24],"In":[25,42],"some":[26],"cases,":[27],"this":[28],"bound":[30,82],"is":[31,74,89,107],"just":[32],"a":[33,100],"constant":[34],"factor":[35],"away":[36],"from":[37],"known":[39,80],"upper":[40,81],"bounds.":[41],"particular,":[43],"show":[45],"that":[46,56,95],"for":[47,83,111],"any":[48,112],"$\\varepsilon>0$":[49],"there":[50],"exists":[51],"$q_0$":[52],"$n_0$":[54],"such":[55],"if":[57],"$q\\geq":[58],"q_0$":[59],"$n\\geq":[61],"n_0$,":[62],"then":[63],"metric":[65,85,97],"dimension":[66,86,98],"point-hyperplane":[69],"graph":[71],"$\\mathrm{PG}(n,q)$":[73,88],"at":[75,108],"least":[76,109],"$(2-\\varepsilon)nq$.":[77],"The":[78],"best":[79],"roughly":[90],"$4nq$.":[91],"also":[93],"prove":[94],"$(v,k,\\lambda)$":[102],"design,":[103],"under":[104],"certain":[105],"conditions,":[106],"$\\frac{(2-\\varepsilon)uv}k$":[110],"$\\varepsilon":[113],">0$,":[114],"where":[115],"$u=\\left\\lfloor\\frac{\\ln":[116],"v}{\\ln":[117],"v":[118],"-":[119],"\\ln":[120],"k":[121],"+1}\\right\\rfloor$.":[122]},"counts_by_year":[],"updated_date":"2026-03-11T06:11:40.159057","created_date":"2026-01-23T00:00:00"}