{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:21Z","timestamp":1758586221352,"version":"3.44.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_26","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:47Z","timestamp":1758498347000},"page":"350-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity of\u00a0Minimal Faithful Permutation Degree for\u00a0Fitting-Free Groups"],"prefix":"10.1007","author":[{"given":"Michael","family":"Levet","sequence":"first","affiliation":[]},{"given":"Pranjal","family":"Srivastava","sequence":"additional","affiliation":[]},{"given":"Dhara","family":"Thakkar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","unstructured":"Babai, L., Luks, E., Seress, A.: Permutation groups in NC. In: STOC 1987, STOC \u201987, pp. 409\u2013420. Association for Computing Machinery, New York (1987). https:\/\/doi.org\/10.1145\/28395.28439","DOI":"10.1145\/28395.28439"},{"key":"26_CR2","doi-asserted-by":"publisher","unstructured":"Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y.: Code equivalence and group isomorphism. In: Proceedings of the Twenty-Second Annual ACM\u2013SIAM Symposium on Discrete Algorithms (SODA11), pp. 1395\u20131408. SIAM, Philadelphia (2011). https:\/\/doi.org\/10.1137\/1.9781611973082.107","DOI":"10.1137\/1.9781611973082.107"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-31594-7_5","volume-title":"Automata, Languages, and Programming","author":"L Babai","year":"2012","unstructured":"Babai, L., Codenotti, P., Qiao, Y.: Polynomial-time isomorphism test for groups with no abelian normal subgroups. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 51\u201362. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_5"},{"key":"26_CR4","unstructured":"Brachter, J.: Combinatorial approaches to the group isomorphism problem. Ph.D. thesis, TU Darmstadt (2023). https:\/\/tuprints.ulb.tu-darmstadt.de\/26387\/1\/thesis_brachter.pdf"},{"key":"26_CR5","doi-asserted-by":"publisher","unstructured":"Cannon, J.J., Holt, D.F.: Automorphism group computation and isomorphism testing in finite groups. J. Symb. Comput. 35, 241\u2013267 (2003). https:\/\/doi.org\/10.1016\/S0747-7171(02)00133-5","DOI":"10.1016\/S0747-7171(02)00133-5"},{"key":"26_CR6","doi-asserted-by":"publisher","unstructured":"Cannon, J.J., Holt, D.F., Unger, W.R.: The use of permutation representations in structural computations in large finite matrix groups. J. Symbolic Comput. 95, 26\u201338 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2018.09.001","DOI":"10.1016\/j.jsc.2018.09.001"},{"key":"26_CR7","volume-title":"Simple Groups of Lie Type","author":"RW Carter","year":"1989","unstructured":"Carter, R.W.: Simple Groups of Lie Type, vol. 22. John Wiley & Sons, New York (1989)"},{"key":"26_CR8","unstructured":"Chamberlain, R.: Permutation Representations of Group Quotients and of Quasisimple Groups. Ph.D. thesis, University of Warwick (2020). https:\/\/wrap.warwick.ac.uk\/id\/eprint\/149881\/"},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilson, R.A.: $$\\mathbb{ATLAS}$$ of finite groups. Oxford University Press, Eynsham, Eynsham, UK (1985). https:\/\/doi.org\/10.1017\/S0025557200139440. maximal subgroups and ordinary characters for simple groups, With computational assistance from J. G. Thackray","DOI":"10.1017\/S0025557200139440"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Das, B., Thakkar, D.: The minimal faithful permutation degree of groups without abelian normal subgroups. In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, pp. 118\u2013129. Association for Computing Machinery, New York (2024). https:\/\/doi.org\/10.1145\/3618260.3649641","DOI":"10.1145\/3618260.3649641"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Dixon, J.D., Mortimer, B.: Permutation groups, Graduate Texts in Mathematics, vol.\u00a0163. Springer-Verlag, New York (1996). https:\/\/doi.org\/10.1007\/978-1-4612-0731-3,https:\/\/doi.org\/10.1007\/978-1-4612-0731-3","DOI":"10.1007\/978-1-4612-0731-3"},{"key":"26_CR12","unstructured":"Grochow, J.A.: Lemmas about Socle. Personal Communication (2025)"},{"key":"26_CR13","doi-asserted-by":"publisher","unstructured":"Grochow, J.A., Levet, M.: On the descriptive complexity of groups without Abelian normal subgroups (extended abstract). In: Achilleos, A., Monica, D.D. (eds.) Proceedings of the Fourteenth International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2023, Udine, Italy, 18-20th September 2023. EPTCS, vol.\u00a0390, pp. 185\u2013202 (2023). https:\/\/doi.org\/10.4204\/EPTCS.390.12, preprint of full version at arXiv:2209.13725 [cs.LO]","DOI":"10.4204\/EPTCS.390.12"},{"key":"26_CR14","doi-asserted-by":"publisher","unstructured":"Grochow, J.A., Levet, M.: On the parallel complexity of group isomorphism via Weisfeiler-Leman. In: Fernau, H., Jansen, K. (eds.) Fundamentals of Computation Theory - 24th International Symposium, FCT 2023, Trier, Germany, 18\u201321 September 2023, Proceedings. Lecture Notes in Computer Science, vol. 14292, pp. 234\u2013247. Springer (2023).https:\/\/doi.org\/10.1007\/978-3-031-43587-4_17. preprint of full version at arXiv: 2112.11487 [cs.DS]","DOI":"10.1007\/978-3-031-43587-4_17"},{"issue":"11","key":"26_CR15","doi-asserted-by":"publisher","first-page":"7665","DOI":"10.1090\/S0002-9947-2015-06293-X","volume":"367","author":"S Guest","year":"2015","unstructured":"Guest, S., Morris, J., Praeger, C., Spiga, P.: On the maximum orders of elements of finite almost simple groups and primitive permutation groups. Trans. Am. Math. Soc. 367(11), 7665\u20137694 (2015). https:\/\/doi.org\/10.1090\/S0002-9947-2015-06293-X","journal-title":"Trans. Am. Math. Soc."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Holt, D.F., Eick, B., O\u2019Brien, E.A.: Handbook of Computational Group Theory. Chapman and Hall\/CRC (2005)","DOI":"10.1201\/9781420035216"},{"issue":"4","key":"26_CR17","doi-asserted-by":"publisher","first-page":"857","DOI":"10.2307\/2373739","volume":"93","author":"DL Johnson","year":"1971","unstructured":"Johnson, D.L.: Minimal permutation representations of finite groups. Am. J. Math. 93(4), 857\u2013866 (1971). https:\/\/doi.org\/10.2307\/2373739","journal-title":"Am. J. Math."},{"key":"26_CR18","doi-asserted-by":"publisher","unstructured":"Kantor, W., Seress, A.: Black box classical groups. Mem. Am. Math. Soc. 708 (2001). https:\/\/doi.org\/10.1090\/memo\/0708","DOI":"10.1090\/memo\/0708"},{"key":"26_CR19","doi-asserted-by":"publisher","unstructured":"Kantor, W.M., Luks, E.M.: Computing in quotient groups. In: Ortiz, H. (ed.) Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, May 13-17, 1990, Baltimore, Maryland, USA, pp. 524\u2013534. ACM (1990). https:\/\/doi.org\/10.1145\/100216.100290","DOI":"10.1145\/100216.100290"},{"issue":"1","key":"26_CR20","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/JAGM.1999.0982","volume":"31","author":"WM Kantor","year":"1999","unstructured":"Kantor, W.M., Luks, E.M., Mark, P.D.: Sylow subgroups in parallel. J. Algorithms 31(1), 132\u2013195 (1999). https:\/\/doi.org\/10.1006\/JAGM.1999.0982","journal-title":"J. Algorithms"},{"key":"26_CR21","doi-asserted-by":"publisher","unstructured":"Kleidman, P.B., Liebeck, M.W.: The Subgroup Structure of The Finite Classical Groups, vol.\u00a0129. Cambridge University Press, Cambridge (1990). https:\/\/doi.org\/10.1017\/CBO9780511629235","DOI":"10.1017\/CBO9780511629235"},{"key":"26_CR22","unstructured":"Levet, M., Srivastava, P., Thakkar, D.: Complexity of minimal faithful permutation degree for fitting-free groups (2025). https:\/\/arxiv.org\/abs\/2501.16039"},{"issue":"1","key":"26_CR23","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF01193603","volume":"43","author":"MW Liebeck","year":"1984","unstructured":"Liebeck, M.W.: On minimal degrees and base sizes of primitive permutation groups. Arch. Math. 43(1), 11\u201315 (1984). https:\/\/doi.org\/10.1007\/BF01193603","journal-title":"Arch. Math."},{"issue":"1","key":"26_CR24","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K Mulmuley","year":"1987","unstructured":"Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Comb. 7(1), 101\u2013104 (1987). https:\/\/doi.org\/10.1007\/BF02579205","journal-title":"Comb."},{"key":"26_CR25","doi-asserted-by":"publisher","unstructured":"Neumann, P.M.: Some algorithms for computing with finite permutation groups. In: Proceedings of Groups St. Andrews 1985. vol.\u00a0121, pp. 59\u201392. Cambridge Univ. Press, Cambridge, Cambridge (1985). https:\/\/doi.org\/10.1017\/CBO9780511600647.006","DOI":"10.1017\/CBO9780511600647.006"},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Rotman, J.J.: An Introduction to The Theory of Groups, Graduate Texts in Mathematics, fourth edn., vol.\u00a0148. Springer-Verlag, New York (1995). https:\/\/doi.org\/10.1007\/978-1-4612-4176-8","DOI":"10.1007\/978-1-4612-4176-8"},{"key":"26_CR27","doi-asserted-by":"publisher","unstructured":"Seress, A.: Permutation Group Algorithms. Cambridge Tracts in Mathematics, Cambridge University Press (2003). https:\/\/doi.org\/10.1017\/CBO9780511546549","DOI":"10.1017\/CBO9780511546549"},{"key":"26_CR28","unstructured":"Thakkar, D.: On Computing Optimal Representations of Finite Groups. Ph.D. thesis, Indian Institute of Technology Gandhinagar (2024). https:\/\/drive.google.com\/file\/d\/1e2W5NvGr6DTHj6UHYxudw3xBQReHUqsN\/view"},{"issue":"6","key":"26_CR29","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF02366397","volume":"35","author":"AV Vasil\u00e8v","year":"1996","unstructured":"Vasil\u00e8v, A.V.: Minimal permutation representations of finite simple exceptional groups of types $$G_2$$ and $$F_4$$. Algebra Logic 35(6), 371\u2013383 (1996). https:\/\/doi.org\/10.1007\/BF02366397","journal-title":"Algebra Logic"},{"issue":"5","key":"26_CR30","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BF02671607","volume":"36","author":"AV Vasil\u00e8v","year":"1997","unstructured":"Vasil\u00e8v, A.V.: Minimal permutation representations of finite simple exceptional groups of types $$E_6$$, $$E_7$$, and $$E_8$$. Algebra Logic 36(5), 302\u2013310 (1997). https:\/\/doi.org\/10.1007\/BF02671607","journal-title":"Algebra Logic"},{"issue":"1","key":"26_CR31","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02684081","volume":"37","author":"AV Vasil\u00e8v","year":"1998","unstructured":"Vasil\u00e8v, A.V.: Minimal permutation representations of finite simple exceptional twisted groups. Algebra Logic 37(1), 9\u201320 (1998). https:\/\/doi.org\/10.1007\/BF02684081","journal-title":"Algebra Logic"},{"issue":"6","key":"26_CR32","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF00756348","volume":"33","author":"AV Vasil\u00e8v","year":"1995","unstructured":"Vasil\u00e8v, A.V., Mazurov, V.D.: Minimal permutation representations of finite simple orthogonal groups. Algebra Logic 33(6), 337\u2013350 (1995). https:\/\/doi.org\/10.1007\/BF00756348","journal-title":"Algebra Logic"},{"key":"26_CR33","doi-asserted-by":"publisher","unstructured":"Wilson, R.: The finite simple groups, Graduate Texts in Mathematics, vol.\u00a0251. Springer, London (2009). https:\/\/doi.org\/10.1007\/978-1-84800-988-2","DOI":"10.1007\/978-1-84800-988-2"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:48Z","timestamp":1758498348000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}