{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T04:08:23Z","timestamp":1745035703755,"version":"3.40.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T00:00:00Z","timestamp":1726531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,9,17]],"date-time":"2024-09-17T00:00:00Z","timestamp":1726531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100020618","name":"Universit\u00e4t Bayreuth","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100020618","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":[[2025,4]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Combinatorial designs have been studied for nearly 200 years. 50 years ago, Cameron, Delsarte, and Ray-Chaudhury started investigating their <jats:italic>q<\/jats:italic>-analogs, also known as subspace designs or designs over finite fields. Designs can be defined analogously in finite classical polar spaces, too. The definition includes the <jats:italic>m<\/jats:italic>-regular systems from projective geometry as the special case where the blocks are generators of the polar space. The first nontrivial such designs for <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$t &gt; 1$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>t<\/mml:mi>\n                    <mml:mo>&gt;<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> were found by De Bruyn and Vanhove in 2012, and some more designs appeared recently in the PhD thesis of Lansdown. In this article, we investigate the theory of classical and subspace designs for applicability to designs in polar spaces, explicitly allowing arbitrary block dimensions. In this way, we obtain divisibility conditions on the parameters, derived and residual designs, intersection numbers and an analog of Fisher\u2019s inequality. We classify the parameters of symmetric designs. Furthermore, we conduct a computer search to construct designs of strength <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$t=2$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>t<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>, resulting in designs for more than 140 previously unknown parameter sets in various classical polar spaces over <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathbb {F}_2$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> and <jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\mathbb {F}_3$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msub>\n                    <mml:mi>F<\/mml:mi>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:msub>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s10623-024-01491-x","type":"journal-article","created":{"date-parts":[[2024,9,18]],"date-time":"2024-09-18T13:43:13Z","timestamp":1726666993000},"page":"1143-1162","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Designs in finite classical polar spaces"],"prefix":"10.1007","volume":"93","author":[{"given":"Michael","family":"Kiermaier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai-Uwe","family":"Schmidt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfred","family":"Wassermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,9,17]]},"reference":[{"issue":"5","key":"1491_CR1","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s00013-023-01829-2","volume":"120","author":"RF Bailey","year":"2023","unstructured":"Bailey R.F., Spiga P.: Metric dimension of dual polar graphs. Arch. Math. 120(5), 467\u2013478 (2023). https:\/\/doi.org\/10.1007\/s00013-023-01829-2.","journal-title":"Arch. Math."},{"key":"1491_CR2","doi-asserted-by":"publisher","unstructured":"Ball S.: Finite Geometry and Combinatorial Applications. London Mathematical Society Student Texts, Number\u00a082. Cambridge University Press, Cambridge (2015). https:\/\/doi.org\/10.1017\/CBO9781316257449.","DOI":"10.1017\/CBO9781316257449"},{"issue":"5","key":"1491_CR3","doi-asserted-by":"publisher","first-page":"1573","DOI":"10.1007\/s10623-017-0373-1","volume":"86","author":"J Bamberg","year":"2018","unstructured":"Bamberg J., Lansdown J., Lee M.: On $$m$$-ovoids of regular near polygons. Des. Codes Cryptogr. 86(5), 1573\u20137586 (2018). https:\/\/doi.org\/10.1007\/s10623-017-0373-1.","journal-title":"Des. Codes Cryptogr."},{"issue":"4","key":"1491_CR4","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1214\/aoms\/1177729958","volume":"20","author":"RC Bose","year":"1949","unstructured":"Bose R.C.: A note on Fisher\u2019s inequality for balanced incomplete block designs. Ann. Math. Stat. 20(4), 619\u2013620 (1949). https:\/\/doi.org\/10.1214\/aoms\/1177729958.","journal-title":"Ann. Math. Stat."},{"issue":"3\u20134","key":"1491_CR5","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125.","journal-title":"J. Symb. Comput."},{"key":"1491_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.jcta.2016.11.004","volume":"147","author":"M Braun","year":"2017","unstructured":"Braun M., Kiermaier M., Kohnert A., Laue R.: Large sets of subspace designs. J. Combin. Theory Ser. A 147, 155\u2013185 (2017). https:\/\/doi.org\/10.1016\/j.jcta.2016.11.004.","journal-title":"J. Combin. Theory Ser. A"},{"key":"1491_CR7","doi-asserted-by":"publisher","unstructured":"Braun M., Kiermaier M., Wassermann A.: $$q$$-analogs of designs: subspace designs. In: Network Coding and Subspace Designs, Signals and Communication Technology, pp. 171\u2013211. Springer, Cham (2018a). https:\/\/doi.org\/10.1007\/978-3-319-70293-3_8.","DOI":"10.1007\/978-3-319-70293-3_8"},{"key":"1491_CR8","doi-asserted-by":"publisher","unstructured":"Braun M., Kiermaier M., Wassermann A.: Computational methods in subspace designs. In: Network Coding and Subspace Designs, Signals and Communication Technology, pp. 213\u2013244. Springer, Cham (2018b). https:\/\/doi.org\/10.1007\/978-3-319-70293-3_9.","DOI":"10.1007\/978-3-319-70293-3_9"},{"key":"1491_CR9","doi-asserted-by":"publisher","unstructured":"Brouwer A.E., Van\u00a0Maldeghem H.: Strongly regular graphs. In: Encyclopedia of Mathematics and Its Applications, vol. 182. Cambridge University Press, Cambridge (2022). https:\/\/doi.org\/10.1017\/9781009057226.","DOI":"10.1017\/9781009057226"},{"key":"1491_CR10","unstructured":"Brouwer A.E., Cohen A.M., Neumaier A.: Distance-Regular Graphs. Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge \/ A Series of Modern Surveys in Mathematics. Springer, Berlin (1989)."},{"key":"1491_CR11","doi-asserted-by":"publisher","unstructured":"Cameron P.J.: Generalisation of Fisher\u2019s inequality to fields with more than one element. In: McDonough, T.P., Mavron, V.C. (eds.), Combinatorics\u2014Proceedings of the British Combinatorial Conference 1973. London Mathematical Society Lecture Note Series, No. 13, pp. 9\u201313. Cambridge University Press, Cambridge (1974). https:\/\/doi.org\/10.1017\/CBO9780511662072.003.","DOI":"10.1017\/CBO9780511662072.003"},{"key":"1491_CR12","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Dinitz J.H.: Handbook of Combinatorial Designs (Discrete Mathematics and Its Applications), 2nd edn. Chapman & Hall\/CRC, Boca Raton (2006).","DOI":"10.1201\/9781420010541"},{"key":"1491_CR13","doi-asserted-by":"publisher","unstructured":"Cossidente A., Marino G., Pavese F., Smaldore V.: On regular systems of finite classical polar spaces. Eur. J. Combin. 100, Paper No. 103439, 20 pp (2022). https:\/\/doi.org\/10.1016\/j.ejc.2021.103439. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0195669821001323.","DOI":"10.1016\/j.ejc.2021.103439"},{"key":"1491_CR14","unstructured":"De\u00a0Beule J., Klein A., Metsch K.: Substructures of finite classical polar spaces. In: Storme, L., De\u00a0Beule, J. (eds.) Current Research Topics in Galois Geometry, Mathematics Research Developments, pp. 35\u201361. Nova Science, Hauppauge (2012)."},{"key":"1491_CR15","unstructured":"De\u00a0Bruyn B.: Personal communication, July (2021)."},{"key":"1491_CR16","unstructured":"Delsarte P.: An algebraic approach to the association schemes of coding theory. PhD thesis, Universite Catholique de Louvain (1973)."},{"key":"1491_CR17","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W., Thas J.: General Galois Geometries. Springer, London (2016).","DOI":"10.1007\/978-1-4471-6790-7"},{"issue":"4","key":"1491_CR18","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/BF02760536","volume":"41","author":"WM Kantor","year":"1982","unstructured":"Kantor W.M.: Strongly regular graphs defined by spreads. Israel J. Math. 41(4), 298\u2013312 (1982). https:\/\/doi.org\/10.1007\/BF02760536.","journal-title":"Israel J. Math."},{"issue":"1","key":"1491_CR19","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/0097-3165(91)90071-N","volume":"58","author":"GB Khosrovshahi","year":"1991","unstructured":"Khosrovshahi G.B., Ajoodani-Namini S.: Combining $$t$$-designs. J. Combin. Theory Ser. A 58(1), 26\u201334 (1991). https:\/\/doi.org\/10.1016\/0097-3165(91)90071-N.","journal-title":"J. Combin. Theory Ser. A"},{"issue":"1","key":"1491_CR20","doi-asserted-by":"publisher","first-page":"105","DOI":"10.3934\/amc.2015.9.105","volume":"9","author":"M Kiermaier","year":"2015","unstructured":"Kiermaier M., Laue R.: Derived and residual subspace designs. Adv. Math. Commun. 9(1), 105\u2013115 (2015). https:\/\/doi.org\/10.3934\/amc.2015.9.105.","journal-title":"Adv. Math. Commun."},{"issue":"11","key":"1491_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/jcd.21403","volume":"23","author":"M Kiermaier","year":"2015","unstructured":"Kiermaier M., Pav\u010devi\u0107 M.O.: Intersection numbers for subspace designs. J. Comb. Des. 23(11), 463\u2013480 (2015). https:\/\/doi.org\/10.1002\/jcd.21403.","journal-title":"J. Comb. Des."},{"issue":"2","key":"1491_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.3336\/gm.58.2.03","volume":"58","author":"M Kiermaier","year":"2023","unstructured":"Kiermaier M., Wassermann A.: Higher incidence matrices and tactical decomposition matrices. Glasnik Mat. Ser. III 58(2), 181\u2013200 (2023). https:\/\/doi.org\/10.3336\/gm.58.2.03.","journal-title":"Glasnik Mat. Ser. III"},{"key":"1491_CR23","doi-asserted-by":"publisher","unstructured":"Kiermaier M., Wassermann A.: Dataset for the paper \u201cDesigns in finite classical polar spaces\u201d. Zenodo Open Data Repository (2024). https:\/\/doi.org\/10.5281\/zenodo.13353388.","DOI":"10.5281\/zenodo.13353388"},{"key":"1491_CR24","doi-asserted-by":"publisher","unstructured":"K\u00f6hler E.: Allgemeine Schnittzahlen in $$t$$-Designs. Discret. Math. 73(1\u20132), 133\u2013142 (1988\u20131989). https:\/\/doi.org\/10.1016\/0012-365X(88)90141-0.","DOI":"10.1016\/0012-365X(88)90141-0"},{"issue":"3","key":"1491_CR25","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0012-365X(76)90030-3","volume":"15","author":"ES Kramer","year":"1976","unstructured":"Kramer E.S., Mesner D.M.: $$t$$-designs on hypergraphs. Discret. Math. 15(3), 263\u2013296 (1976). https:\/\/doi.org\/10.1016\/0012-365X(76)90030-3.","journal-title":"Discret. Math."},{"key":"1491_CR26","unstructured":"Lansdown J.: Designs in Finite Geometry. PhD thesis, RWTH Aachen University, The University of Western Australia (2020)."},{"key":"1491_CR27","first-page":"145","volume-title":"Studies in Pure Mathematics","author":"NS Mendelsohn","year":"1971","unstructured":"Mendelsohn N.S.: Intersection numbers of $$t$$-designs. In: Mirsky L. (ed.) Studies in Pure Mathematics, pp. 145\u2013150. Academic Press, London (1971)."},{"key":"1491_CR28","first-page":"55","volume":"19","author":"W Oberschelp","year":"1972","unstructured":"Oberschelp W.: Lotto-Garantiesysteme und Blockpl\u00e4ne. Math. Phys. Sem. Neue Folge 19, 55\u201367 (1972).","journal-title":"Math. Phys. Sem. Neue Folge"},{"key":"1491_CR29","doi-asserted-by":"publisher","unstructured":"Schmidt K.-U., Wei\u00df C.: Packings and Steiner systems in polar spaces. Combin. Theory 3(1), Paper No. 11, 27 pp. (2023). https:\/\/doi.org\/10.5070\/C63160424. https:\/\/escholarship.org\/uc\/item\/83g3149p.","DOI":"10.5070\/C63160424"},{"issue":"1","key":"1491_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02410088","volume":"70","author":"B Segre","year":"1965","unstructured":"Segre B.: Forme e geometrie hermitiane, con particolare riguardo al caso finito. Ann. Mat. 70(1), 1\u2013201 (1965). https:\/\/doi.org\/10.1007\/BF02410088.","journal-title":"Ann. Mat."},{"issue":"4","key":"1491_CR31","doi-asserted-by":"publisher","first-page":"625","DOI":"10.2307\/2374091","volume":"102","author":"D Stanton","year":"1980","unstructured":"Stanton D.: Some $$q$$-Krawtchouk polynomials on Chevalley groups. Am. J. Math. 102(4), 625\u2013662 (1980).","journal-title":"Am. J. Math."},{"key":"1491_CR32","unstructured":"Vanhove F.: Incidence geometry from an algebraic graph theory point of view. PhD thesis, Ghent University (2011)."},{"issue":"2","key":"1491_CR33","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1002\/(SICI)1520-6610(1998)6:2<79::AID-JCD1>3.0.CO;2-S","volume":"6","author":"A Wassermann","year":"1998","unstructured":"Wassermann A.: Finding simple $$t$$-designs with enumeration techniques. J. Combin. Des. 6(2), 79\u201390 (1998).","journal-title":"J. Combin. Des."},{"key":"1491_CR34","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-030-79987-8_2","volume-title":"Combinatorial Algorithms","author":"A Wassermann","year":"2021","unstructured":"Wassermann A.: Search for combinatorial objects using lattice algorithms\u2014revisited. In: Flocchini P., Moura L. (eds.) Combinatorial Algorithms, pp. 20\u201333. Springer, Cham (2021)."},{"key":"1491_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01471-1","author":"C Wei\u00df","year":"2024","unstructured":"Wei\u00df C.: Nontrivial $$t$$-designs in polar spaces exist for all $$t$$. Des. Codes Cryptogr. (2024). https:\/\/doi.org\/10.1007\/s10623-024-01471-1.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01491-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-024-01491-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-024-01491-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T17:30:36Z","timestamp":1744997436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-024-01491-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,17]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["1491"],"URL":"https:\/\/doi.org\/10.1007\/s10623-024-01491-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2024,9,17]]},"assertion":[{"value":"1 March 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2024","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"}}]}}