{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:38:50Z","timestamp":1772753930550,"version":"3.50.1"},"reference-count":6,"publisher":"EDP Sciences","license":[{"start":{"date-parts":[[2020,6,4]],"date-time":"2020-06-04T00:00:00Z","timestamp":1591228800000},"content-version":"vor","delay-in-days":155,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11901319"],"award-info":[{"award-number":["11901319"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["63191349"],"award-info":[{"award-number":["63191349"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2020,3,10]]},"published-print":{"date-parts":[[2020]]},"abstract":"<jats:p>Universal words are words containing exactly once each element from a given set of combinatorial structures admitting encoding by words. Universal partial words (u-p-words) contain, in addition to the letters from the alphabet in question, any number of occurrences of a special \u201cjoker\u201d symbol. We initiate the study of u-p-words for word-patterns (essentially, surjective functions) and (2-)set partitions by proving a number of existence\/non-existence results and thus extending the results in the literature on u-p-words and u-p-cycles for words and permutations. We apply methods of graph theory and combinatorics on words to obtain our results.<\/jats:p>","DOI":"10.1051\/ita\/2020004","type":"journal-article","created":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T07:48:20Z","timestamp":1591343300000},"page":"5","source":"Crossref","is-referenced-by-count":3,"title":["On universal partial words for word-patterns and set partitions"],"prefix":"10.1051","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1668-5089","authenticated-orcid":false,"given":"Herman Z.Q.","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Kitaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2020,6,4]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/S0895480104445678","volume":"19","author":"Burstein","year":"2005","journal-title":"SIAM J. Discr. Math."},{"key":"R2","first-page":"16","volume":"19","author":"Chen","year":"2017","journal-title":"Discr. Math. Theor. Comp. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","volume":"110","author":"Chung","year":"1992","journal-title":"Discr. Math."},{"key":"R4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.tcs.2017.12.022","volume":"713","author":"Goeckner","year":"2018","journal-title":"Theor. Comp. Sci."},{"key":"R5","doi-asserted-by":"crossref","first-page":"4","DOI":"10.37236\/5051","volume":"22","author":"Higgins","year":"2015","journal-title":"Electron. J. Combin."},{"key":"R6","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.dam.2019.01.025","volume":"260","author":"Kitaev","year":"2019","journal-title":"Discr. Appl. Math."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2020004\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,5]],"date-time":"2020-06-05T07:48:25Z","timestamp":1591343305000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ita.org\/10.1051\/ita\/2020004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":6,"alternative-id":["ita190010"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2020004","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}