{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:21:38Z","timestamp":1765164098367,"version":"3.46.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\/1117(0008)\/2019-EMR-I"],"award-info":[{"award-number":["09\/1117(0008)\/2019-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s00373-025-02987-6","type":"journal-article","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T17:52:44Z","timestamp":1761414764000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enumeration of splitting subsets of endofunctions on finite sets"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6985-4125","authenticated-orcid":false,"given":"Divya","family":"Aggarwal","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,25]]},"reference":[{"key":"2987_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.102081","volume":"83","author":"D Aggarwal","year":"2022","unstructured":"Aggarwal, D., Ram, S.: Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields. Finite Fields Appl. 83, 102081 (2022)","journal-title":"Finite Fields Appl."},{"key":"2987_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101982","volume":"78","author":"D Aggarwal","year":"2022","unstructured":"Aggarwal, D., Ram, S.: Splitting subspaces of linear operators over finite fields. Finite Fields Appl. 78, 101982 (2022)","journal-title":"Finite Fields Appl."},{"issue":"4","key":"2987_CR3","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1007\/s10801-020-00963-2","volume":"53","author":"A Arora","year":"2021","unstructured":"Arora, A., Ram, S., Venkateswarlu, A.: Unimodular polynomial matrices over finite fields. J. Algebraic Combin. 53(4), 1299\u20131312 (2021)","journal-title":"J. Algebraic Combin."},{"key":"2987_CR4","doi-asserted-by":"crossref","unstructured":"Bergeron, F., Labelle, G., Leroux, P.: Combinatorial species and tree-like structures, volume\u00a067 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (1998). Translated from the 1994 French original by Margaret Readdy, With a foreword by Gian-Carlo Rota","DOI":"10.1017\/CBO9781107325913"},{"key":"2987_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ffa.2013.05.006","volume":"24","author":"E Chen","year":"2013","unstructured":"Chen, E., Tseng, D.: The splitting subspace conjecture. Finite Fields Appl. 24, 15\u201328 (2013)","journal-title":"Finite Fields Appl."},{"key":"2987_CR6","doi-asserted-by":"crossref","unstructured":"Ghorpade, S.R., Ram, S.: Enumeration of splitting subspaces over finite fields. In Arithmetic, geometry, cryptography and coding theory, volume 574 of Contemp. Math., pages 49\u201358. Amer. Math. Soc., Providence, RI (2012)","DOI":"10.1090\/conm\/574\/11430"},{"key":"2987_CR7","unstructured":"Loehr, N.A.: Bijective combinatorics. Discrete Mathematics and its Applications (Boca Raton). CRC Press, Boca Raton, FL (2011)"},{"issue":"1","key":"2987_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/ffta.1995.1002","volume":"1","author":"H Niederreiter","year":"1995","unstructured":"Niederreiter, H.: The multiple-recursive matrix method for pseudorandom number generation. Finite Fields Appl. 1(1), 3\u201330 (1995)","journal-title":"Finite Fields Appl."},{"issue":"2","key":"2987_CR9","first-page":"62","volume":"4","author":"A Prasad","year":"2019","unstructured":"Prasad, A.: An introduction to Schur polynomials. Grad. J. Math. 4(2), 62\u201384 (2019)","journal-title":"Grad. J. Math."},{"key":"2987_CR10","unstructured":"Prasad, A., Ram, S.: Set partitions, tableaux, and subspace profiles under regular split semisimple matrices. arXiv preprint arXiv:2112.00479, (2021)"},{"key":"2987_CR11","unstructured":"Prasad, A., Ram, S.: Set partitions, tableaux, and subspace profiles of regular diagonal operators. S\u00e9m. Lothar. Combin., 86B:Art. 35, 12 (2022)"},{"key":"2987_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2023.103705","volume":"110","author":"A Prasad","year":"2023","unstructured":"Prasad, A., Ram, S.: Splitting subspaces and a finite field interpretation of the touchard-riordan formula. Eur. J. Comb. 110, 103705 (2023)","journal-title":"Eur. J. Comb."},{"issue":"1","key":"2987_CR13","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.jcta.2004.04.009","volume":"108","author":"V Reiner","year":"2004","unstructured":"Reiner, V., Stanton, D., White, D.: The cyclic sieving phenomenon. J. Combin. Theory Ser. A 108(1), 17\u201350 (2004)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"2","key":"2987_CR14","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1090\/noti1084","volume":"61","author":"V Reiner","year":"2014","unstructured":"Reiner, V., Stanton, D., White, D.: What is ...cyclic sieving? Notices Amer. Math. Soc. 61(2), 169\u2013171 (2014)","journal-title":"Notices Amer. Math. Soc."},{"key":"2987_CR15","doi-asserted-by":"crossref","unstructured":"Sagan, B.E.: The cyclic sieving phenomenon: a survey. In Surveys in combinatorics 2011, volume 392 of London Math. Soc. Lecture Note Ser., pages 183\u2013233. Cambridge Univ. Press, Cambridge (2011)","DOI":"10.1017\/CBO9781139004114.006"},{"key":"2987_CR16","unstructured":"Stanley, R.P.: Enumerative combinatorics. Vol. 2, volume\u00a062 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (1999). With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin"},{"key":"2987_CR17","unstructured":"Stanley, R.P.: Enumerative combinatorics. Volume 1, volume\u00a049 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge, second edition (2012)"},{"issue":"2","key":"2987_CR18","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1215\/S0012-7094-94-07320-1","volume":"73","author":"JR Stembridge","year":"1994","unstructured":"Stembridge, J.R.: On minuscule representations, plane partitions and involutions in complex Lie groups. Duke Math. J. 73(2), 469\u2013490 (1994)","journal-title":"Duke Math. J."},{"issue":"2","key":"2987_CR19","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/0097-3165(94)90112-0","volume":"68","author":"JR Stembridge","year":"1994","unstructured":"Stembridge, J.R.: Some hidden relations involving the ten symmetry classes of plane partitions. J. Combin. Theory Ser. A 68(2), 372\u2013409 (1994)","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"2987_CR20","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1215\/S0012-7094-96-08224-1","volume":"82","author":"JR Stembridge","year":"1996","unstructured":"Stembridge, J.R.: Canonical bases and self-evacuating tableaux. Duke Math. J. 82(3), 585\u2013606 (1996)","journal-title":"Duke Math. J."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02987-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02987-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02987-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T03:20:30Z","timestamp":1765164030000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02987-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,25]]},"references-count":20,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["2987"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02987-6","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,10,25]]},"assertion":[{"value":"30 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no competing interests to declare that are relevant to the article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"121"}}