{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:33:01Z","timestamp":1776105181139,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T00:00:00Z","timestamp":1772409600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271023"],"award-info":[{"award-number":["12271023"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171034"],"award-info":[{"award-number":["12171034"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin Municipality","doi-asserted-by":"publisher","award":["24JCZDJC01390"],"award-info":[{"award-number":["24JCZDJC01390"]}],"id":[{"id":"10.13039\/501100006606","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RF-2023-065\\\\9"],"award-info":[{"award-number":["RF-2023-065\\\\9"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.disc.2026.115081","type":"journal-article","created":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T11:14:24Z","timestamp":1772709264000},"page":"115081","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["On shortening universal words for multi-dimensional permutations"],"prefix":"10.1016","volume":"349","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3324-1647","authenticated-orcid":false,"given":"Sergey","family":"Kitaev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dun","family":"Qiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115081_br0010","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2023.105801","article-title":"Singleton mesh patterns in multidimensional permutations","volume":"201","author":"Avgustinovich","year":"2024","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.disc.2026.115081_br0020","doi-asserted-by":"crossref","DOI":"10.1007\/s10623-025-01609-9","article-title":"Universal partial tori","author":"Carey","year":"2025","journal-title":"Des. Codes Cryptogr."},{"key":"10.1016\/j.disc.2026.115081_br0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2025.104203","article-title":"Patterns in multi-dimensional permutations","volume":"130","author":"Chen","year":"2025","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115081_br0040","doi-asserted-by":"crossref","DOI":"10.1051\/ita\/2020004","article-title":"On universal partial words for word-patterns and set partitions","volume":"54","author":"Chen","year":"2020","journal-title":"RAIRO Theor. Inform. Appl."},{"issue":"1","key":"10.1016\/j.disc.2026.115081_br0050","article-title":"On universal partial words","volume":"19","author":"Chen","year":"2017","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.disc.2026.115081_br0060","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(92)90699-G","article-title":"Universal cycles for combinatorial structures","volume":"110","author":"Chung","year":"1992","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115081_br0070","series-title":"A Collection of Puzzles in Honor of Martin Gardner's 90th Birthday","first-page":"35","article-title":"Products of universal cycles","author":"Diaconis","year":"2008"},{"issue":"2","key":"10.1016\/j.disc.2026.115081_br0080","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","article-title":"A survey of full length nonlinear shift register cycle algorithms","volume":"24","author":"Fredricksen","year":"1982","journal-title":"SIAM Rev."},{"issue":"1","key":"10.1016\/j.disc.2026.115081_br0090","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1142\/S0129054119400033","article-title":"On a greedy algorithm to construct universal cycles for permutations","volume":"30","author":"Gao","year":"2019","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.disc.2026.115081_br0100","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.tcs.2017.12.022","article-title":"Universal partial words over non-binary alphabets","volume":"713","author":"Goeckner","year":"2018","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.disc.2026.115081_br0110","series-title":"Universal cycles: on beyond de Bruijn","author":"Hurlbert","year":"1990"},{"key":"10.1016\/j.disc.2026.115081_br0130","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.dam.2019.01.025","article-title":"On shortening u-cycles and u-words for permutations","volume":"260","author":"Kitaev","year":"2019","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115081_br0140","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/j.dam.2024.08.010","article-title":"On a family of universal cycles for multi-dimensional permutations","volume":"359","author":"Kitaev","year":"2024","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115081_br0150","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.dam.2022.09.026","article-title":"Shortened universal cycles for permutations","volume":"324","author":"Kirsch","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.disc.2026.115081_br0160","series-title":"Enumerative Combinatorics, vol. 2","author":"Stanley","year":"1999"},{"key":"10.1016\/j.disc.2026.115081_br0170","first-page":"203","article-title":"Circuits and trees in oriented linear graphs","volume":"28","author":"van Aardenne-Ehrenfest","year":"1951","journal-title":"Simon Stevin"},{"issue":"5","key":"10.1016\/j.disc.2026.115081_br0180","article-title":"Enumeration of factorizable multi-dimensional permutations","volume":"10","author":"Zhang","year":"2007","journal-title":"J. Integer Seq."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T17:18:10Z","timestamp":1776100690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26001056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":17,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["S0012365X26001056"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115081","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On shortening universal words for multi-dimensional permutations","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115081","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"115081"}}