{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T23:38:29Z","timestamp":1772753909610,"version":"3.50.1"},"reference-count":10,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2019,1]]},"abstract":"<jats:p> A universal cycle for permutations of length [Formula: see text] is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length [Formula: see text], and containing all permutations of length [Formula: see text] as factors. It is well known that universal cycles for permutations of length [Formula: see text] exist. However, all known ways to construct such cycles are rather complicated. For example, in the original paper establishing the existence of the universal cycles, constructing such a cycle involves finding an Eulerian cycle in a certain graph and then dealing with partially ordered sets. <\/jats:p><jats:p> In this paper, we offer a simple way to generate a universal cycle for permutations of length [Formula: see text], which is based on applying a greedy algorithm to a permutation of length [Formula: see text]. We prove that this approach gives a unique universal cycle [Formula: see text] for permutations, and we study properties of [Formula: see text]. <\/jats:p>","DOI":"10.1142\/s0129054119400033","type":"journal-article","created":{"date-parts":[[2019,3,5]],"date-time":"2019-03-05T09:13:14Z","timestamp":1551777194000},"page":"61-72","source":"Crossref","is-referenced-by-count":5,"title":["On a Greedy Algorithm to Construct Universal Cycles for Permutations"],"prefix":"10.1142","volume":"30","author":[{"given":"Alice L. L.","family":"Gao","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Northwestern Polytechnical University, Xi\u2019an, Shaanxi 710072, P. R. China"}]},{"given":"Sergey","family":"Kitaev","sequence":"additional","affiliation":[{"name":"Department of Computer and Information Sciences, University of Strathclyde, 26 Richmond Street, Glasgow G1 1XH, UK"}]},{"given":"Wolfgang","family":"Steiner","sequence":"additional","affiliation":[{"name":"IRIF, CNRS UMR 8243, Universit\u00e9 Paris Diderot \u2013 Paris 7, 75205 Paris Cedex 13, Paris, France"}]},{"given":"Philip B.","family":"Zhang","sequence":"additional","affiliation":[{"name":"College of Mathematical Science, Tianjin Normal University, Tianjin 300387, P. R. China"}]}],"member":"219","published-online":{"date-parts":[[2019,3,5]]},"reference":[{"key":"S0129054119400033BIB002","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(92)90699-G"},{"key":"S0129054119400033BIB003","first-page":"758","volume":"49","author":"de Bruijn N. G.","year":"1946","journal-title":"Nederl. Akad. Wetensch. Proc."},{"key":"S0129054119400033BIB004","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14031-0_33"},{"key":"S0129054119400033BIB005","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-011-9544-z"},{"key":"S0129054119400033BIB006","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)00314-9"},{"key":"S0129054119400033BIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2005.05.007"},{"key":"S0129054119400033BIB008","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90330-V"},{"key":"S0129054119400033BIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2007.11.004"},{"key":"S0129054119400033BIB011","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1934-05988-3"},{"key":"S0129054119400033BIB012","doi-asserted-by":"publisher","DOI":"10.1145\/1798596.1798598"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054119400033","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T18:35:27Z","timestamp":1565116527000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054119400033"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1]]},"references-count":10,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2019,3,5]]},"published-print":{"date-parts":[[2019,1]]}},"alternative-id":["10.1142\/S0129054119400033"],"URL":"https:\/\/doi.org\/10.1142\/s0129054119400033","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1]]}}}