{"id":"https://openalex.org/W3082316413","doi":"https://doi.org/10.37236/10842","title":"Tight Bound for the Number of Distinct Palindromes in a Tree","display_name":"Tight Bound for the Number of Distinct Palindromes in a Tree","publication_year":2023,"publication_date":"2023-04-21","ids":{"openalex":"https://openalex.org/W3082316413","doi":"https://doi.org/10.37236/10842","mag":"3082316413"},"language":"en","primary_location":{"id":"doi:10.37236/10842","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10842","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i2p10/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/v30i2p10/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5022706035","display_name":"Pawe\u0142 Gawrychowski","orcid":"https://orcid.org/0000-0002-6993-5440"},"institutions":[{"id":"https://openalex.org/I219388962","display_name":"University of Wroc\u0142aw","ror":"https://ror.org/00yae6e25","country_code":"PL","type":"education","lineage":["https://openalex.org/I219388962"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Pawe\u0142 Gawrychowski","raw_affiliation_strings":["University of Wroc\u0142aw"],"affiliations":[{"raw_affiliation_string":"University of Wroc\u0142aw","institution_ids":["https://openalex.org/I219388962"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086467798","display_name":"Tomasz Kociumaka","orcid":"https://orcid.org/0000-0002-2477-1702"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tomasz Kociumaka","raw_affiliation_strings":["University of California, Berkeley"],"affiliations":[{"raw_affiliation_string":"University of California, Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079957387","display_name":"Wojciech Rytter","orcid":"https://orcid.org/0000-0002-9162-6724"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Wojciech Rytter","raw_affiliation_strings":["University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061843884","display_name":"Tomasz Wale\u0144","orcid":"https://orcid.org/0000-0002-7369-3309"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Tomasz Wale\u0144","raw_affiliation_strings":["University of Warsaw"],"affiliations":[{"raw_affiliation_string":"University of Warsaw","institution_ids":["https://openalex.org/I4654613"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022706035"],"corresponding_institution_ids":["https://openalex.org/I219388962"],"apc_list":null,"apc_paid":null,"fwci":0.2017,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.48138217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"30","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T11567","display_name":"semigroups and automata theory","score":0.9997000098228455,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/palindrome","display_name":"Palindrome","score":0.9441006183624268},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.9165569543838501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8337438106536865},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7118260264396667},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6210306286811829},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5967535376548767},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5425184369087219},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.48195621371269226},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.449833482503891},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.41380929946899414},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4123390316963196},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36290812492370605},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.1964658498764038},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1377834677696228},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07008415460586548}],"concepts":[{"id":"https://openalex.org/C44667518","wikidata":"https://www.wikidata.org/wiki/Q12321","display_name":"Palindrome","level":4,"score":0.9441006183624268},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.9165569543838501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8337438106536865},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7118260264396667},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6210306286811829},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5967535376548767},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5425184369087219},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.48195621371269226},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.449833482503891},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.41380929946899414},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4123390316963196},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36290812492370605},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.1964658498764038},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1377834677696228},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07008415460586548},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C98108389","wikidata":"https://www.wikidata.org/wiki/Q412563","display_name":"CRISPR","level":3,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/10842","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10842","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i2p10/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/10842","is_oa":true,"landing_page_url":"https://doi.org/10.37236/10842","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v30i2p10/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/W3082316413.pdf"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1492488103","https://openalex.org/W1511909700","https://openalex.org/W1970774636","https://openalex.org/W1972084722","https://openalex.org/W1980577621","https://openalex.org/W2005055946","https://openalex.org/W2011999472","https://openalex.org/W2035314514","https://openalex.org/W2049732011","https://openalex.org/W2151180867","https://openalex.org/W2394811645","https://openalex.org/W2563726981","https://openalex.org/W2804704843","https://openalex.org/W2912435829","https://openalex.org/W2913518517","https://openalex.org/W2963157978","https://openalex.org/W2991490899","https://openalex.org/W3042165818","https://openalex.org/W4243237799","https://openalex.org/W4246219036","https://openalex.org/W6891511176"],"related_works":["https://openalex.org/W4303648025","https://openalex.org/W4386827042","https://openalex.org/W3118394355","https://openalex.org/W4303648019","https://openalex.org/W3165029596","https://openalex.org/W3202838341","https://openalex.org/W2587883304","https://openalex.org/W2394811645","https://openalex.org/W3120084479","https://openalex.org/W3082316413"],"abstract_inverted_index":{"For":[0,84],"an":[1,55,104,113],"undirected":[2],"tree":[3,47],"with":[4],"edges":[5,50],"labeled":[6],"by":[7],"single":[8],"letters,":[9],"we":[10,70],"consider":[11],"its":[12,32],"substrings,":[13],"which":[14],"are":[15,91],"labels":[16],"of":[17,41,48,58,75,82],"the":[18,38,72,78,94,119],"simple":[19,92],"paths":[20],"between":[21],"two":[22],"nodes.":[23],"A":[24],"palindrome":[25,121],"is":[26,98],"a":[27,46,123],"word":[28],"$w$":[29],"equal":[30],"to":[31],"reverse":[33],"$w^R$.":[34],"We":[35,101],"prove":[36],"that":[37,67,90],"maximum":[39,79,95],"number":[40],"distinct":[42,110],"palindromic":[43,80,96],"substrings":[44],"in":[45,122],"$n$":[49],"satisfies":[51],"$\\text{pal}(n)=O(n^{1.5})$.":[52],"This":[53],"solves":[54],"open":[56],"problem":[57],"Brlek,":[59],"Lafreni\u00e8re,":[60],"and":[61,112],"Proven\u00e7al":[62],"(DLT":[63],"2015),":[64],"who":[65],"showed":[66],"$\\text{pal}(n)=\\Omega(n^{1.5})$.":[68],"Hence,":[69],"settle":[71],"tight":[73],"bound":[74],"$\\Theta(n^{1.5})$":[76],"for":[77,88],"complexity":[81,97],"trees.":[83],"standard":[85],"strings,":[86],"i.e.,":[87],"trees":[89],"paths,":[93],"exactly":[99],"$n+1$.":[100],"also":[102],"propose":[103],"$O(n^{1.5}":[105],"\\log^{0.5}{n})$-time":[106],"algorithm":[107,117],"reporting":[108],"all":[109],"palindromes":[111],"$O(n":[114],"\\log^2":[115],"n)$-time":[116],"finding":[118],"longest":[120],"tree.":[124]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-12-26T23:08:49.675405","created_date":"2025-10-10T00:00:00"}