{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:16:13Z","timestamp":1772892973889,"version":"3.50.1"},"reference-count":44,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.jcta.2025.106156","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T10:56:32Z","timestamp":1766400992000},"page":"106156","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Periods of strongly connected multivariate digraphs"],"prefix":"10.1016","volume":"221","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-4670-4447","authenticated-orcid":false,"given":"Chengyang","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6811-7067","authenticated-orcid":false,"given":"Yaokun","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1724-5250","authenticated-orcid":false,"given":"Yinfeng","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2\u20133","key":"10.1016\/j.jcta.2025.106156_br0010","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(02)00428-4","article-title":"On partitions of discrete boxes","volume":"257","author":"Alon","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106156_br0020","article-title":"Numerical Semigroups and Applications","volume":"vol. 3","author":"Assi","year":"2020"},{"issue":"4","key":"10.1016\/j.jcta.2025.106156_br0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113848","article-title":"On partitions of two-dimensional discrete boxes","volume":"347","author":"Ackerman","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106156_br0040","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","article-title":"Partial words and a theorem of Fine and Wilf","volume":"218","author":"Berstel","year":"1999","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcta.2025.106156_br0050","series-title":"Numerical Semigroups","volume":"vol. 40","year":"2020"},{"key":"10.1016\/j.jcta.2025.106156_br0060","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.jcta.2019.02.011","article-title":"Partition problems in high dimensional boxes","volume":"166","author":"Bucic","year":"2019","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"9","key":"10.1016\/j.jcta.2025.106156_br0070","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113487","article-title":"On the existence of balanced generalized de Bruijn sequences","volume":"346","author":"Baker","year":"2023","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106156_br0080","article-title":"Combinatorial Matrix Theory","volume":"vol. 39","author":"Brualdi","year":"1991"},{"key":"10.1016\/j.jcta.2025.106156_br0090","doi-asserted-by":"crossref","first-page":"299","DOI":"10.2307\/2371684","article-title":"On a problem of partitions","volume":"64","author":"Brauer","year":"1942","journal-title":"Am. J. Math."},{"key":"10.1016\/j.jcta.2025.106156_br0100","series-title":"Theory and Applications of Models of Computation","first-page":"128","article-title":"Binary de Bruijn partial words with one hole","volume":"vol. 6108","author":"Blanchet-Sadri","year":"2010"},{"issue":"1","key":"10.1016\/j.jcta.2025.106156_br0110","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.jcta.2025.106156_br0120","series-title":"Mathematical Foundations of Computer Science 2014. 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25\u201329, 2014. Proceedings, Part I","first-page":"135","article-title":"Universal Lyndon words","author":"Carpi","year":"2014"},{"key":"10.1016\/j.jcta.2025.106156_br0130","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.jcta.2025.106156_br0140","article-title":"On universal partial words","volume":"19","author":"Chen","year":"2017","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/j.jcta.2025.106156_br0150","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.endm.2017.06.043","article-title":"On universal partial words","volume":"61","author":"Chen","year":"2017","journal-title":"Electron. Notes Discrete Math."},{"issue":"8","key":"10.1016\/j.jcta.2025.106156_br0160","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1016\/j.ejc.2004.06.018","article-title":"De Bruijn digraphs and affine transformations","volume":"26","author":"Deng","year":"2005","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jcta.2025.106156_br0170","author":"Fillmore"},{"key":"10.1016\/j.jcta.2025.106156_br0180","series-title":"String-Matching and Other Products","author":"Fischer","year":"1974"},{"key":"10.1016\/j.jcta.2025.106156_br0190","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.jcta.2025.106156_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2021.104689","article-title":"Maximal state complexity and generalized de Bruijn words","volume":"284","author":"Gabric","year":"2022","journal-title":"Inf. Comput."},{"issue":"4","key":"10.1016\/j.jcta.2025.106156_br0210","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s00493-004-0037-4","article-title":"Minimal partitions of a box into boxes","volume":"24","author":"Grytczuk","year":"2004","journal-title":"Combinatorica"},{"key":"10.1016\/j.jcta.2025.106156_br0220","author":"Granville"},{"issue":"5","key":"10.1016\/j.jcta.2025.106156_br0230","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1017\/S0963548314000704","article-title":"Query complexity of sampling and small geometric partitions","volume":"24","author":"Goyal","year":"2015","journal-title":"Comb. Probab. Comput."},{"issue":"5","key":"10.1016\/j.jcta.2025.106156_br0240","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1142\/S0129054118420078","article-title":"Square-free partial words with many wildcards","volume":"29","author":"Gasnikov","year":"2018","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.jcta.2025.106156_br0250","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.ejc.2019.03.003","article-title":"On 2-colored graphs and partitions of boxes","volume":"79","author":"Holzman","year":"2019","journal-title":"Eur. J. Comb."},{"issue":"1\u20133","key":"10.1016\/j.jcta.2025.106156_br0260","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0012-365X(99)00042-4","article-title":"Finite algebras of finite complexity","volume":"207","author":"Kearnes","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106156_br0270","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."},{"issue":"5","key":"10.1016\/j.jcta.2025.106156_br0280","doi-asserted-by":"crossref","first-page":"1439","DOI":"10.1007\/s10623-023-01351-0","article-title":"Using alternating de Bruijn sequences to construct de Bruijn tori","volume":"92","author":"Kreitzer","year":"2024","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"10.1016\/j.jcta.2025.106156_br0290","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00454-007-9005-2","article-title":"Polyboxes, cube tilings and rigidity","volume":"40","author":"Kisielewicz","year":"2008","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/j.jcta.2025.106156_br0300","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.jcta.2025.106156_br0310","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipl.2025.106590","article-title":"The complexity of computing the period and the exponent of a digraph","volume":"191","author":"Kiefer","year":"2026","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/j.jcta.2025.106156_br0320","series-title":"Mathematics Unlimited\u20142001 and Beyond","first-page":"771","article-title":"Periods","author":"Kontsevich","year":"2001"},{"key":"10.1016\/j.jcta.2025.106156_br0330","article-title":"Tensors: Geometry and Applications","volume":"vol. 128","author":"Landsberg","year":"2012"},{"key":"10.1016\/j.jcta.2025.106156_br0340","series-title":"On the existence and structure of De Bruijn-like sequences","author":"Martin","year":"2024"},{"key":"10.1016\/j.jcta.2025.106156_br0350","series-title":"2021 IEEE International Symposium on Information Theory (ISIT)","first-page":"1528","article-title":"Balanced de Bruijn sequences","author":"Marcovich","year":"2021"},{"issue":"5","key":"10.1016\/j.jcta.2025.106156_br0360","doi-asserted-by":"crossref","first-page":"2923","DOI":"10.1109\/TIT.2022.3227467","article-title":"On hierarchies of balanced sequences","volume":"69","author":"Marcovich","year":"2023","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"10.1016\/j.jcta.2025.106156_br0370","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0195-6698(89)80064-2","article-title":"Highly arc transitive digraphs","volume":"10","author":"Praeger","year":"1989","journal-title":"Eur. J. Comb."},{"issue":"3","key":"10.1016\/j.jcta.2025.106156_br0380","doi-asserted-by":"crossref","DOI":"10.1007\/s00373-021-02443-1","article-title":"Cyclic arrangements with minimum modulo m winding numbers","volume":"38","author":"Qian","year":"2022","journal-title":"Graphs Comb."},{"key":"10.1016\/j.jcta.2025.106156_br0390","article-title":"Numerical Semigroups","volume":"vol. 20","author":"Rosales","year":"2009"},{"issue":"2\u20133","key":"10.1016\/j.jcta.2025.106156_br0400","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0012-365X(02)00596-4","article-title":"Kleitman and combinatorics","volume":"257","author":"Saks","year":"2002","journal-title":"Discrete Math."},{"key":"10.1016\/j.jcta.2025.106156_br0410","series-title":"Mathematical Foundations of Computer Science 2001. 26th International Symposium, MFCS 2001, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, Czech Republic, August 27\u201331, 2001. Proceedings","first-page":"657","article-title":"On the periods of partial words","author":"Shur","year":"2001"},{"key":"10.1016\/j.jcta.2025.106156_br0420","series-title":"Analysis, Combinatorics and Computing","first-page":"419","article-title":"Some characterizations for the wrapped butterfly","author":"Wu","year":"2002"},{"key":"10.1016\/j.jcta.2025.106156_br0430","doi-asserted-by":"crossref","first-page":"381","DOI":"10.13001\/1081-3810.3088","article-title":"An expansion property of Boolean linear maps","volume":"31","author":"Wu","year":"2016","journal-title":"Electron. J. Linear Algebra"},{"issue":"1","key":"10.1016\/j.jcta.2025.106156_br0440","article-title":"Strongly connected multivariate digraphs","volume":"24","author":"Wu","year":"2017","journal-title":"Electron. J. Comb."}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316525001517?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316525001517?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T17:36:38Z","timestamp":1772818598000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316525001517"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":44,"alternative-id":["S0097316525001517"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2025.106156","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Periods of strongly connected multivariate digraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2025.106156","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106156"}}