{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T07:45:33Z","timestamp":1774943133589,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T00:00:00Z","timestamp":1749513600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T00:00:00Z","timestamp":1749513600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"INdAM-GNSAGA"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s10623-025-01657-1","type":"journal-article","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T03:21:51Z","timestamp":1749525711000},"page":"3863-3874","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Shiftable Heffter spaces"],"prefix":"10.1007","volume":"93","author":[{"given":"M.","family":"Buratti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Pasotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,10]]},"reference":[{"key":"1657_CR1","doi-asserted-by":"crossref","unstructured":"Archdeacon D.S.: Heffter arrays and biembedding graphs on surfaces. Electron. J. Combin. 22, #P1.74 (2015).","DOI":"10.37236\/4874"},{"key":"1657_CR2","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1002\/jcd.21520","volume":"25","author":"DS Archdeacon","year":"2017","unstructured":"Archdeacon D.S., Boothby T., Dinitz J.H.: Tight Heffter arrays exist for all possible values. J. Combin. Des. 25, 5\u201335 (2017).","journal-title":"J. Combin. Des."},{"key":"1657_CR3","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10623-015-0076-4","volume":"77","author":"DS Archdeacon","year":"2015","unstructured":"Archdeacon D.S., Dinitz J.H., Donovan D.M., Yaz\u0131c\u0131 E.\u015e: Square integer Heffter arrays with empty cells. Des. Codes Cryptogr. 77, 409\u2013426 (2015).","journal-title":"Des. Codes Cryptogr."},{"key":"1657_CR4","doi-asserted-by":"publisher","DOI":"10.3138\/9781442656529","volume-title":"Mathematical Recreations and Essays","author":"WWR Ball","year":"1974","unstructured":"Ball W.W.R., Coxeter H.S.M.: Mathematical Recreations and Essays, 12th edn University of Toronto Press, Toronto (1974).","edition":"12"},{"key":"1657_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139507660","volume-title":"Design Theory","author":"T Beth","year":"1999","unstructured":"Beth T., Jungnickel D., Lenz H.: Design Theory. Cambridge University Press, Cambridge (1999)."},{"key":"1657_CR6","doi-asserted-by":"crossref","unstructured":"Bryant D., Gavlas H., Ling A.: Skolem-type difference sets for cycles. Electron. J. Combin. 10, #R38 (2003).","DOI":"10.37236\/1731"},{"key":"1657_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-031-48679-1_2","volume":"86","author":"M Buratti","year":"2024","unstructured":"Buratti M.: Tight Heffter arrays from finite fields. Fields Inst. Commun. 86, 25\u201336 (2024).","journal-title":"Fields Inst. Commun."},{"key":"1657_CR8","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0012-365X(02)00463-6","volume":"261","author":"M Buratti","year":"2003","unstructured":"Buratti M., Del Fra A.: Existence of cyclic k-cycle systems of the complete graph. Discret. Math. 261, 113\u2013125 (2003).","journal-title":"Discret. Math."},{"key":"1657_CR9","volume":"85","author":"M Buratti","year":"2025","unstructured":"Buratti M., Merola F., Nakic A.: Additive combinatorial designs, additive combinatorial designs. Des. Codes Cryptogr. 85, 102116 (2025).","journal-title":"Des. Codes Cryptogr."},{"key":"1657_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.102116","volume":"85","author":"M Buratti","year":"2023","unstructured":"Buratti M., Nakic A.: Super-regular Steiner $$2$$-designs. Finite Fields Appl. 85, 102116 (2023).","journal-title":"Finite Fields Appl."},{"key":"1657_CR11","doi-asserted-by":"publisher","first-page":"3561","DOI":"10.1007\/s10623-024-01452-4","volume":"92","author":"M Buratti","year":"2024","unstructured":"Buratti M., Nakic A.: Additivity of symmetric and subspace $$2$$-designs. Des. Codes Cryptogr. 92, 3561\u20133572 (2024).","journal-title":"Des. Codes Cryptogr."},{"key":"1657_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2024.102464","volume":"98","author":"M Buratti","year":"2024","unstructured":"Buratti M., Pasotti A.: Heffter spaces. Finite Fields Appl. 98, 102464 (2024).","journal-title":"Finite Fields Appl."},{"key":"1657_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1002\/jcd.21974","volume":"33","author":"M Buratti","year":"2025","unstructured":"Buratti M., Pasotti A.: More Heffter spaces via finite fields. J. Combin. Des. 33, 188\u2013194 (2025).","journal-title":"J. Combin. Des."},{"key":"1657_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10801-020-01001-x","volume":"55","author":"M Buratti","year":"2022","unstructured":"Buratti M., Stinson D.R.: On resolvable Golomb rulers, symmetric configurations and progressive dinner parties. J. Algebr. Combin. 55, 141\u2013156 (2022).","journal-title":"J. Algebr. Combin."},{"key":"1657_CR15","doi-asserted-by":"crossref","unstructured":"Burgess A.C., Cavenagh N.J., Pike D.A.: Mutually orthogonal cycle systems. Ars Math. Contemp. 23, #P2.05 (2023).","DOI":"10.26493\/1855-3974.2692.86d"},{"key":"1657_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111787","volume":"343","author":"K Burrage","year":"2020","unstructured":"Burrage K., Donovan D.M., Cavenagh N.J., Yazici E.S.: Globally simple Heffter arrays $$H(n; k)$$ when $$k \\equiv 0, 3$$$$($$mod $$4)$$. Discret. Math. 343, 111787 (2020).","journal-title":"Discret. Math."},{"key":"1657_CR17","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10801-016-0707-5","volume":"45","author":"A Caggegi","year":"2017","unstructured":"Caggegi A., Falcone G., Pavone M.: On the additivity of block designs. J. Algebr. Comb. 45, 271\u2013294 (2017).","journal-title":"J. Algebr. Comb."},{"key":"1657_CR18","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10801-020-00941-8","volume":"53","author":"A Caggegi","year":"2021","unstructured":"Caggegi A., Falcone G., Pavone M.: Additivity of affine designs. J. Algebr. Comb. 53, 755\u2013770 (2021).","journal-title":"J. Algebr. Comb."},{"key":"1657_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.26493\/1855-3974.1817.b97","volume":"17","author":"NJ Cavenagh","year":"2019","unstructured":"Cavenagh N.J., Dinitz J.H., Donovan D., Yaz\u0131c\u0131 E.\u015e: The existence of square non-integer Heffter arrays. Ars Math. Contemp. 17, 369\u2013395 (2019).","journal-title":"Ars Math. Contemp."},{"key":"1657_CR20","first-page":"549","volume":"72","author":"S Costa","year":"2018","unstructured":"Costa S., Morini F., Pasotti A., Pellegrini M.A.: Globally simple Heffter arrays and orthogonal cyclic cycle decompositions. Australs. J. Combin. 72, 549\u2013593 (2018).","journal-title":"Australs. J. Combin."},{"key":"1657_CR21","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010541","volume-title":"Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2006","unstructured":"Colbourn C.J., Dinitz J.H.: Handbook of Combinatorial Designs, 2nd edn CRC, Boca Raton (2006).","edition":"2"},{"key":"1657_CR22","doi-asserted-by":"publisher","first-page":"81","DOI":"10.26493\/1855-3974.1121.fbf","volume":"13","author":"JH Dinitz","year":"2017","unstructured":"Dinitz J.H., Wanless I.M.: The existence of square integer Heffter arrays. Ars Math. Contemp. 13, 81\u201393 (2017).","journal-title":"Ars Math. Contemp."},{"key":"1657_CR23","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1007\/s10623-021-00853-z","volume":"89","author":"G Falcone","year":"2021","unstructured":"Falcone G., Pavone M.: Binary Hamming codes and Boolean designs. Des. Codes Cryptogr. 89, 1261\u20131277 (2021).","journal-title":"Des. Codes Cryptogr."},{"key":"1657_CR24","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/j.dam.2019.02.019","volume":"266","author":"G G\u00e9vay","year":"2019","unstructured":"G\u00e9vay G.: Resolvable configurations. Discret. Appl. Math. 266, 319\u2013330 (2019).","journal-title":"Discret. Appl. Math."},{"key":"1657_CR25","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/jcd.21921","volume":"32","author":"S Kukukcifci","year":"2024","unstructured":"Kukukcifci S., Yaz\u0131c\u0131 E.\u015e: Orthogonal cycle systems with cycle length less than 10. J. Combin. Des. 32, 31\u201345 (2024).","journal-title":"J. Combin. Des."},{"key":"1657_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2024.105873","volume":"205","author":"L Mella","year":"2024","unstructured":"Mella L., Traetta T.: Constructing generalized Heffter arrays via near alternating sign matrices. J. Combin. Theory A 205, 105873 (2024).","journal-title":"J. Combin. Theory A"},{"key":"1657_CR27","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/978-3-031-48679-1_20","volume":"86","author":"A Pasotti","year":"2024","unstructured":"Pasotti A., Dinitz J.H.: A survey of Heffter arrays. Fields Inst. Commun. 86, 353\u2013392 (2024).","journal-title":"Fields Inst. Commun."},{"key":"1657_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2023.102277","volume":"92","author":"M Pavone","year":"2023","unstructured":"Pavone M.: A quasidouble of the affine plane of order $$4$$ and the solution of a problem on additive designs. Finite Fields Appl. 92, 102277 (2023).","journal-title":"Finite Fields Appl."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01657-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01657-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01657-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,15]],"date-time":"2025-09-15T17:30:44Z","timestamp":1757957444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01657-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,10]]},"references-count":28,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["1657"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01657-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,10]]},"assertion":[{"value":"20 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 June 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}