{"id":"https://openalex.org/W2062881236","doi":"https://doi.org/10.1137/s0895480104445678","title":"On Unavoidable Sets of Word Patterns","display_name":"On Unavoidable Sets of Word Patterns","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2062881236","doi":"https://doi.org/10.1137/s0895480104445678","mag":"2062881236"},"language":"en","primary_location":{"id":"doi:10.1137/s0895480104445678","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480104445678","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067148186","display_name":"Alexander Burstein","orcid":"https://orcid.org/0000-0001-9454-8066"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Alexander Burstein","raw_affiliation_strings":["Iowa State University"],"affiliations":[{"raw_affiliation_string":"Iowa State University","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024451009","display_name":"Sergey Kitaev","orcid":"https://orcid.org/0000-0003-3324-1647"},"institutions":[{"id":"https://openalex.org/I3130035786","display_name":"University Ucinf","ror":"https://ror.org/02cs9pv18","country_code":"CL","type":"education","lineage":["https://openalex.org/I3130035786"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Sergey Kitaev","raw_affiliation_strings":["Computer And Information Sciences"],"affiliations":[{"raw_affiliation_string":"Computer And Information Sciences","institution_ids":["https://openalex.org/I3130035786"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067148186"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.3367,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.62355991,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"19","issue":"2","first_page":"371","last_page":"381"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9995999932289124,"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.9995999932289124,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9944999814033508,"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"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9804999828338623,"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/mathematics","display_name":"Mathematics","score":0.7107045650482178},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7053238153457642},{"id":"https://openalex.org/keywords/de-bruijn-graph","display_name":"De Bruijn graph","score":0.5387891530990601},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.49991917610168457},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4944605827331543},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4821719527244568},{"id":"https://openalex.org/keywords/de-bruijn-sequence","display_name":"De Bruijn sequence","score":0.4573918581008911},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4529310166835785},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.4285815954208374},{"id":"https://openalex.org/keywords/circle-graph","display_name":"Circle graph","score":0.4111676812171936},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15580132603645325},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.1302759051322937}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7107045650482178},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7053238153457642},{"id":"https://openalex.org/C20218877","wikidata":"https://www.wikidata.org/wiki/Q3066095","display_name":"De Bruijn graph","level":3,"score":0.5387891530990601},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.49991917610168457},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4944605827331543},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4821719527244568},{"id":"https://openalex.org/C170320093","wikidata":"https://www.wikidata.org/wiki/Q1953457","display_name":"De Bruijn sequence","level":2,"score":0.4573918581008911},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4529310166835785},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.4285815954208374},{"id":"https://openalex.org/C171528893","wikidata":"https://www.wikidata.org/wiki/Q5121450","display_name":"Circle graph","level":5,"score":0.4111676812171936},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15580132603645325},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.1302759051322937},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0895480104445678","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0895480104445678","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.9183","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.9183","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.ru.is/static/papers/BuKi05__On_unavoidable.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.320.2390","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.320.2390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://orion.math.iastate.edu/burstein/papers/burkit_final.pdf","raw_type":"text"},{"id":"pmh:oai:strathprints.strath.ac.uk:49799","is_oa":false,"landing_page_url":"https://strathprints.strath.ac.uk/49799/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402226","display_name":"Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I181647926","host_organization_name":"University of Strathclyde","host_organization_lineage":["https://openalex.org/I181647926"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4","score":0.75}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1480210121","https://openalex.org/W1514324498","https://openalex.org/W1584587517","https://openalex.org/W1586417893","https://openalex.org/W1950939890","https://openalex.org/W1980664567","https://openalex.org/W2007453203","https://openalex.org/W2011039300","https://openalex.org/W2017131087","https://openalex.org/W2019338982","https://openalex.org/W2058219874","https://openalex.org/W2077752701","https://openalex.org/W2085157194","https://openalex.org/W2086965829","https://openalex.org/W2090661785","https://openalex.org/W4237930722"],"related_works":["https://openalex.org/W2562683361","https://openalex.org/W3087469195","https://openalex.org/W3125399386","https://openalex.org/W2354744388","https://openalex.org/W2949121831","https://openalex.org/W3215786367","https://openalex.org/W2756186577","https://openalex.org/W2735897904","https://openalex.org/W3030515003","https://openalex.org/W259110494"],"abstract_inverted_index":{"Abstract.":[0],"We":[1,77],"introduce":[2],"the":[3,35,49,86,112,116],"notion":[4],"of":[5,9,18,28,37,48,75,102,111],"unavoidable":[6,26,73],"(complete)":[7],"sets":[8,27,74],"word":[10,100],"patterns,":[11],"which":[12,44,54],"is":[13,45],"a":[14,46,65,80,96],"refinement":[15],"for":[16,25,99],"that":[17,93],"words,":[19],"and":[20,53,85,91,115],"study":[21],"certain":[22],"numerical":[23],"characteristics":[24],"patterns.":[29],"In":[30,60],"some":[31],"cases":[32,62],"we":[33,55,63],"employ":[34],"graph":[36,52],"pattern":[38],"overlaps":[39],"introduced":[40],"in":[41,120],"this":[42],"paper,":[43],"subgraph":[47],"de":[50],"Bruijn":[51],"prove":[56,92],"to":[57,69],"be":[58],"Hamiltonian.":[59],"other":[61],"reduce":[64],"problem":[66,84],"under":[67],"consideration":[68],"known":[70],"facts":[71],"on":[72],"words.":[76],"also":[78],"give":[79],"relation":[81],"between":[82],"our":[83,121],"extensively":[87],"studied":[88],"universal":[89,97],"cycles,":[90],"there":[94],"exists":[95],"cycle":[98],"patterns":[101],"any":[103,106],"length":[104],"over":[105],"alphabet.":[107],"The":[108],"Stirling":[109],"numbers":[110],"second":[113],"kind":[114],"M\u00f6bius":[117],"function":[118],"appear":[119],"results.":[122]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}