{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:24Z","timestamp":1740122544648,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2021,7,4]],"date-time":"2021-07-04T00:00:00Z","timestamp":1625356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,7,4]],"date-time":"2021-07-04T00:00:00Z","timestamp":1625356800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["359872"],"award-info":[{"award-number":["359872"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["PTDC\/MAT-PUR\/31174\/2017"],"award-info":[{"award-number":["PTDC\/MAT-PUR\/31174\/2017"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"crossref","award":["DP160102323"],"award-info":[{"award-number":["DP160102323"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for <jats:inline-formula><jats:alternatives><jats:tex-math>$$m\\ge 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, a set of <jats:inline-formula><jats:alternatives><jats:tex-math>$$m+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> partitions of a set <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\Omega $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03a9<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, any <jats:italic>m<\/jats:italic> of which are the minimal non-trivial elements of a Cartesian lattice, either form a Latin square (if <jats:inline-formula><jats:alternatives><jats:tex-math>$$m=2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>), or generate a join-semilattice of dimension <jats:italic>m<\/jats:italic> associated with a diagonal group over a base group <jats:italic>G<\/jats:italic>. In this paper we investigate what happens if we have <jats:inline-formula><jats:alternatives><jats:tex-math>$$m+r$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>r<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> partitions with <jats:inline-formula><jats:alternatives><jats:tex-math>$$r\\ge 2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>r<\/mml:mi>\n                    <mml:mo>\u2265<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, any <jats:italic>m<\/jats:italic> of which are minimal elements of a Cartesian lattice. If <jats:inline-formula><jats:alternatives><jats:tex-math>$$m=2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, this is just a set of mutually orthogonal Latin squares. We consider the case where all these squares are isotopic to Cayley tables of groups, and give an example to show the groups need not be all isomorphic. For <jats:inline-formula><jats:alternatives><jats:tex-math>$$m&gt;2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, things are more restricted. Any <jats:inline-formula><jats:alternatives><jats:tex-math>$$m+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> of the partitions generate a join-semilattice admitting a diagonal group over a group <jats:italic>G<\/jats:italic>. It may be that the groups are all isomorphic, though we cannot prove this. Under an extra hypothesis, we show that <jats:italic>G<\/jats:italic> must be abelian and must have three fixed-point-free automorphisms whose product is the identity. (We describe explicitly all abelian groups having such automorphisms.) Under this hypothesis, the structure gives an orthogonal array, and conversely in some cases. If the group is cyclic of prime order <jats:italic>p<\/jats:italic>, then the structure corresponds exactly to an arc of cardinality <jats:inline-formula><jats:alternatives><jats:tex-math>$$m+r$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>r<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in the <jats:inline-formula><jats:alternatives><jats:tex-math>$$(m-1)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>m<\/mml:mi>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-dimensional projective space over the field with <jats:italic>p<\/jats:italic> elements, so all known results about arcs are applicable. More generally, arcs over a finite field of order <jats:italic>q<\/jats:italic> give examples where <jats:italic>G<\/jats:italic> is the elementary abelian group of order <jats:italic>q<\/jats:italic>. These examples can be lifted to non-elementary abelian groups using <jats:italic>p<\/jats:italic>-adic techniques.<\/jats:p>","DOI":"10.1007\/s10623-021-00907-2","type":"journal-article","created":{"date-parts":[[2021,7,4]],"date-time":"2021-07-04T11:02:10Z","timestamp":1625396530000},"page":"2069-2080","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Diagonal groups and arcs over groups"],"prefix":"10.1007","volume":"90","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8990-2099","authenticated-orcid":false,"given":"R. A.","family":"Bailey","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3130-9505","authenticated-orcid":false,"given":"Peter J.","family":"Cameron","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5227-8632","authenticated-orcid":false,"given":"Michael","family":"Kinyon","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0881-7336","authenticated-orcid":false,"given":"Cheryl E.","family":"Praeger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,4]]},"reference":[{"key":"907_CR1","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1090\/S0002-9947-1943-0009962-7","volume":"54","author":"AA Albert","year":"1943","unstructured":"Albert A.A.: Quasigroups, I. Trans. Am. Math. Soc. 54, 507\u2013519 (1943).","journal-title":"Trans. Am. Math. Soc."},{"key":"907_CR2","unstructured":"Bailey R.A., Cameron P. J., Praeger C. E., Schneider C.: The geometry of diagonal groups. Trans. Amer. Math. Soc., in press."},{"key":"907_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.4171\/EMSS\/33","volume":"6","author":"S Ball","year":"2020","unstructured":"Ball S., Lavrouw M.: Arcs in finite projective spaces. Eur. Math. Soc. Surv. 6, 133\u2013172 (2020).","journal-title":"Eur. Math. Soc. Surv."},{"key":"907_CR4","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF01393742","volume":"92","author":"A Blokhuis","year":"1988","unstructured":"Blokhuis A., Bruen A.A., Thas J.A.: On M.D.S. codes, arcs in PG$$(n, q)$$ with $$q$$ even, and a solution of three fundamental problems of B. Segre. Invent. Math. 92, 441\u2013459 (1988).","journal-title":"Invent. Math."},{"key":"907_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jalgebra.2019.02.025","volume":"545","author":"JN Bray","year":"2020","unstructured":"Bray J.N., Cai Q., Cameron P.J., Spiga P., Zhang H.: The Hall-Paige conjecture, and synchronization for affine and diagonal groups. J. Algebra 545, 27\u201342 (2020).","journal-title":"J. Algebra"},{"key":"907_CR6","volume-title":"Number Theory, Volume I: Tools and Diophantine Equations, Graduate Texts in Mathematics","author":"H Cohen","year":"2007","unstructured":"Cohen H.: Number Theory, Volume I: Tools and Diophantine Equations, Graduate Texts in Mathematics. Springer, New York (2007)."},{"key":"907_CR7","volume-title":"Latin Squares and Their Applications","author":"J D\u00e9nes","year":"1974","unstructured":"D\u00e9nes J., Keedwell A.D.: Latin Squares and Their Applications. Akad\u00e9mai Kaid\u00f3, Budapest (1974)."},{"key":"907_CR8","first-page":"145","volume":"40","author":"ST Dougherty","year":"2008","unstructured":"Dougherty S.T., Szczepanski T.A.: Latin $$k$$-hypercubes. Austral. J. Comb. 40, 145\u2013160 (2008).","journal-title":"Austral. J. Comb."},{"key":"907_CR9","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1090\/mcom\/3010","volume":"85","author":"J Egan","year":"2016","unstructured":"Egan J., Wanless I.M.: Enumeration of MOLS of small order. Math. Comput. 85, 799\u2013824 (2016).","journal-title":"Math. Comput."},{"issue":"1","key":"907_CR10","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.jalgebra.2008.09.028","volume":"321","author":"AB Evans","year":"2009","unstructured":"Evans A.B.: The admissibility of sporadic simple groups. J. Algebra 321(1), 105\u2013116 (2009).","journal-title":"J. Algebra"},{"key":"907_CR11","unstructured":"Fisher R.A.: The Design of Experiments. 2nd edition, Oliver and Boyd, Edinburgh (1937)."},{"key":"907_CR12","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1111\/j.1469-1809.1941.tb02303.x","volume":"11","author":"RA Fisher","year":"1942","unstructured":"Fisher R.A.: Completely orthogonal $$9\\times 9$$ Latin squares. A correction. Ann. Eugen. 11, 402\u2013403 (1942).","journal-title":"Ann. Eugen."},{"key":"907_CR13","volume-title":"Statistical Tables for Biological, Agricultural and Medical Research","author":"RA Fisher","year":"1938","unstructured":"Fisher R.A., Yates F.: Statistical Tables for Biological, Agricultural and Medical Research. Oliver & Boyd, Edinburgh (1938)."},{"key":"907_CR14","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.jcta.2017.10.006","volume":"155","author":"N Franceti\u0107","year":"2018","unstructured":"Franceti\u0107 N., Herke S., Wanless I.M.: Parity of sets of mutually orthogonal Latin squares. J. Comb. Theory (A) 155, 67\u201399 (2018).","journal-title":"J. Comb. Theory (A)"},{"key":"907_CR15","unstructured":"Frolov M.: Recherches sur les permutations carr\u00e9es, J. Math. Sp\u00e9c. (3) 4, 8\u201311 (1890)."},{"key":"907_CR16","doi-asserted-by":"crossref","unstructured":"Hall L.M. Jr., Paige J.: Complete mappings of finite groups. Pac. J. Math. 5, 541\u2013549 (1955).","DOI":"10.2140\/pjm.1955.5.541"},{"key":"907_CR17","doi-asserted-by":"crossref","unstructured":"Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays: Theory and Applications. Springer Series in Statistics. Springer, New York (1999).","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"907_CR18","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1137\/070693874","volume":"22","author":"BD McKay","year":"2008","unstructured":"McKay B.D., Wanless I.M.: A census of small Latin hypercubes. SIAM J. Discret. Math. 22, 719\u2013736 (2008).","journal-title":"SIAM J. Discret. Math."},{"key":"907_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0378-3758(98)00059-7","volume":"73","author":"GL Mullen","year":"1998","unstructured":"Mullen G.L.: Orthogonal hypercubes and related designs. J. Stat. Plann. Inference 73, 177\u2013188 (1998).","journal-title":"J. Stat. Plann. Inference"},{"key":"907_CR20","first-page":"83","volume":"18","author":"PJ Owens","year":"1995","unstructured":"Owens P.J., Preece D.A.: Complete sets of pairwise orthogonal Latin squares of order $$9$$. J. Comb. Math. Comb. Comput. 18, 83\u201396 (1995).","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"907_CR21","doi-asserted-by":"crossref","unstructured":"Owens P.J., Preece D.A.: Aspects of complete sets of $$9 \\times 9$$ pairwise orthogonal Latin squares. Discret. Math. 167\/168, 519\u2013525 (1997).","DOI":"10.1016\/S0012-365X(97)89938-4"},{"key":"907_CR22","unstructured":"Passman D.S.: Permutation Groups, Dover Publications (revised republication of the work orginally published in 1968 by the W. A. Benjamin Company), New York (2012)."},{"key":"907_CR23","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1002\/jcd.21718","volume":"28","author":"VN Potapov","year":"2020","unstructured":"Potapov V.N.: Constructions of pairs of orthogonal Latin cubes. J. Comb. Des. 28, 604\u2013613 (2020).","journal-title":"J. Comb. Des."},{"key":"907_CR24","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02410779","volume":"39","author":"B Segre","year":"1955","unstructured":"Segre B.: Curve razionali normali e $$k$$-archi negli spazi finiti. Ann. Mat. Pura Appl. (4) 39, 357\u2013379 (1955).","journal-title":"Ann. Mat. Pura Appl. (4)"},{"key":"907_CR25","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10587-005-0060-7","volume":"55","author":"M Trenkler","year":"2005","unstructured":"Trenkler M.: On orthogonal Latin $$p$$-dimensional cubes. Czechosolvak Math. J. 55, 725\u2013728 (2005).","journal-title":"Czechosolvak Math. J."},{"issue":"5","key":"907_CR26","doi-asserted-by":"publisher","first-page":"1407","DOI":"10.1016\/j.jalgebra.2008.11.033","volume":"321","author":"S Wilcox","year":"2009","unstructured":"Wilcox S.: Reduction of the Hall-Paige conjecture to sporadic simple groups. J. Algebra 321(5), 1407\u20131428 (2009).","journal-title":"J. Algebra"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00907-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00907-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,27]],"date-time":"2022-08-27T15:14:49Z","timestamp":1661613289000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00907-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,4]]},"references-count":26,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["907"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00907-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,7,4]]},"assertion":[{"value":"30 October 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}