{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T20:32:48Z","timestamp":1777321968010,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2026,4]]},"abstract":"Abstract<\/jats:title>\n \n We introduce an algorithm to decompose matrix representations of the symmetric group over the reals into irreducible representations, which as a by-product also computes the multiplicities of the irreducible representations. The algorithm applied to a\n d<\/jats:italic>\n -dimensional representation of\n \n \n $$S_n$$<\/jats:tex-math>\n \n \n S<\/mml:mi>\n n<\/mml:mi>\n <\/mml:msub>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n is shown to have a complexity of\n \n \n $${\\mathcal {O}}(n^2 d^3)$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n \n n<\/mml:mi>\n 2<\/mml:mn>\n <\/mml:msup>\n \n d<\/mml:mi>\n 3<\/mml:mn>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n operations for determining which irreducible representations are present and their corresponding multiplicities and a further\n \n \n $${\\mathcal {O}}(n d^4)$$<\/jats:tex-math>\n \n \n O<\/mml:mi>\n (<\/mml:mo>\n n<\/mml:mi>\n \n d<\/mml:mi>\n 4<\/mml:mn>\n <\/mml:msup>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n operations to fully decompose representations with non-trivial multiplicities. These complexity bounds are pessimistic and in a practical implementation using floating point arithmetic and exploiting sparsity we observe better complexity. We demonstrate this algorithm on the problem of computing multiplicities of two tensor products of irreducible representations (the Kronecker coefficients problem) as well as higher order tensor products. For hook and hook-like irreducible representations the algorithm has polynomial complexity as\n n<\/jats:italic>\n increases. We also demonstrate an application to constructing a basis of homogeneous polynomials so that applying a permutation of variables induces an irreducible representation.\n <\/jats:p>","DOI":"10.1007\/s10208-025-09697-8","type":"journal-article","created":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T11:00:49Z","timestamp":1739185249000},"page":"1069-1092","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Representations of the Symmetric Group are Decomposable in Polynomial Time"],"prefix":"10.1007","volume":"26","author":[{"given":"Sheehan","family":"Olver","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,10]]},"reference":[{"issue":"4","key":"9697_CR1","doi-asserted-by":"publisher","first-page":"927","DOI":"10.1137\/0614062","volume":"14","author":"A Bunse-Gerstner","year":"1993","unstructured":"A.\u00a0Bunse-Gerstner, R.\u00a0Byers, and V.\u00a0Mehrmann. Numerical methods for simultaneous diagonalization. SIAM J. Mat. Anal. Appl., 14(4):927\u2013949, 1993.","journal-title":"SIAM J. Mat. Anal. Appl."},{"key":"9697_CR2","doi-asserted-by":"crossref","unstructured":"P.\u00a0B\u00fcrgisser and C.\u00a0Ikenmeyer. The complexity of computing Kronecker coefficients. In Discrete Mathematics and Theoretical Computer Science, pages 357\u2013368. Discrete Mathematics and Theoretical Computer Science, 2008.","DOI":"10.46298\/dmtcs.3622"},{"key":"9697_CR3","doi-asserted-by":"crossref","unstructured":"T.\u00a0Ceccherini-Silberstein, F.\u00a0Scarabotti, and F.\u00a0Tolli. Representation Theory of the Symmetric Groups: the Okounkov\u2013Vershik Approach, Character Formulas, and Partition Algebras, volume 121. Cambridge University Press, 2010.","DOI":"10.1017\/CBO9781139192361"},{"key":"9697_CR4","doi-asserted-by":"crossref","unstructured":"M.\u00a0Christandl, B.\u00a0Doran, and M.\u00a0Walter. Computing multiplicities of Lie group representations. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pages 639\u2013648. IEEE, 2012.","DOI":"10.1109\/FOCS.2012.43"},{"key":"9697_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S096249291100002X","volume":"20","author":"SH Christiansen","year":"2011","unstructured":"S.\u00a0H. Christiansen, H.\u00a0Z. Munthe-Kaas, and B.\u00a0Owren. Topics in structure-preserving discretization. Acta Numerica, 20:1\u2013119, 2011.","journal-title":"Acta Numerica"},{"key":"9697_CR6","unstructured":"M.\u00a0Collowald and E.\u00a0Hubert. A moment matrix approach to computing symmetric cubatures. Technical report, hal-01188290, 2015."},{"issue":"111","key":"9697_CR7","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1090\/S0025-5718-1970-0280611-6","volume":"24","author":"JD Dixon","year":"1970","unstructured":"J.\u00a0D. Dixon. Computing irreducible representations of groups. Maths Comp., 24(111):707\u2013712, 1970.","journal-title":"Maths Comp."},{"key":"9697_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107786134","volume-title":"Orthogonal Polynomials of Several Variables","author":"C\u00a0F Dunkl","year":"2014","unstructured":"C.\u00a0F. Dunkl and Y.\u00a0Xu. Orthogonal Polynomials of Several Variables, volume 155. Cambridge University Press, Cambridge, 2014."},{"key":"9697_CR9","unstructured":"A.\u00a0F\u00e4ssler. Application of group theory to the method of finite elements for solving boundary value problems. PhD thesis, ETH Zurich, 1976."},{"key":"9697_CR10","unstructured":"W.\u00a0Fulton and J.\u00a0Harris. Representation Theory: a First Course, volume 129. Springer Science & Business Media, 2013."},{"issue":"1\u20133","key":"9697_CR11","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jpaa.2003.12.011","volume":"192","author":"K Gatermann","year":"2004","unstructured":"K.\u00a0Gatermann and P.\u00a0A. Parrilo. Symmetry groups, semidefinite programs, and sums of squares. Journal of Pure and Applied Algebra, 192(1-3):95\u2013128, 2004.","journal-title":"Journal of Pure and Applied Algebra"},{"issue":"1","key":"9697_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0021-8693(78)90200-4","volume":"53","author":"L Geissinger","year":"1978","unstructured":"L.\u00a0Geissinger and D.\u00a0Kinch. Representations of the hyperoctahedral groups. J. Algebra, 53(1):1\u201320, 1978.","journal-title":"J. Algebra"},{"issue":"1","key":"9697_CR13","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1137\/22M1541265","volume":"45","author":"H He","year":"2024","unstructured":"H.\u00a0He and D.\u00a0Kressner. Randomized joint diagonalization of symmetric matrices. SIAM J. Matrix Anal. Appl., 45(1):661\u2013684, 2024.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9697_CR14","doi-asserted-by":"crossref","unstructured":"N.\u00a0J. Higham. Accuracy and Stability of Numerical Algorithms. SIAM, 2002.","DOI":"10.1137\/1.9780898718027"},{"key":"9697_CR15","doi-asserted-by":"crossref","unstructured":"K.\u00a0Hymabaccus and D.\u00a0Pasechnik. Decomposing linear representations of finite groups. arXiv preprint arXiv:2007.02459, 2020.","DOI":"10.21105\/joss.01835"},{"issue":"50","key":"9697_CR16","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.21105\/joss.01835","volume":"5","author":"K Hymabaccus","year":"2020","unstructured":"K.\u00a0Hymabaccus and D.\u00a0Pasechnik. Repndecomp: A GAP package for decomposing linear representations of finite groups. Journal of Open Source Software, 5(50):1835, 2020.","journal-title":"Journal of Open Source Software"},{"key":"9697_CR17","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s00037-017-0158-y","volume":"26","author":"C Ikenmeyer","year":"2017","unstructured":"C.\u00a0Ikenmeyer, K.\u00a0D. Mulmuley, and M.\u00a0Walter. On vanishing of Kronecker coefficients. Computational Complexity, 26:949\u2013992, 2017.","journal-title":"Computational Complexity"},{"issue":"4","key":"9697_CR18","first-page":"166","volume":"47","author":"F Johansson","year":"2013","unstructured":"F.\u00a0Johansson. Arb: a C library for ball arithmetic. ACM Communications in Computer Algebra, 47(4):166\u2013169, 2013.","journal-title":"ACM Communications in Computer Algebra"},{"key":"9697_CR19","doi-asserted-by":"crossref","unstructured":"C.\u00a0Musili. Representations of the hyperoctahedral group \n$${B}_n$$. Representations of Finite Groups, pages 197\u2013220, 1993.","DOI":"10.1007\/978-93-80250-85-4_7"},{"issue":"4","key":"9697_CR20","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/BF02433451","volume":"2","author":"A Okounkov","year":"1996","unstructured":"A.\u00a0Okounkov and A.\u00a0Vershik. A new approach to representation theory of symmetric groups. Selecta Mathematica New Series, 2(4):581\u2013606, 1996.","journal-title":"Selecta Mathematica New Series"},{"key":"9697_CR21","unstructured":"S.\u00a0Olver. NumericalRepresentationTheory.jl v0.3, https:\/\/github.com\/dlfivefifty\/NumericalRepresentationTheory.jl, 2024."},{"issue":"1","key":"9697_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-015-0109-4","volume":"26","author":"I Pak","year":"2017","unstructured":"I.\u00a0Pak and G.\u00a0Panova. On the complexity of computing Kronecker coefficients. Computational Complexity, 26(1):1\u201336, 2017.","journal-title":"Computational Complexity"},{"key":"9697_CR23","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.jcta.2019.01.008","volume":"165","author":"I Pak","year":"2019","unstructured":"I. Pak, G. Panova, and D. Yeliussizov. On the largest Kronecker and Littlewood\u2013Richardson coefficients. Journal of Combinatorial Theory, Series A, 165:44\u201377, 2019.","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"6","key":"9697_CR24","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1006\/jsco.2002.0566","volume":"34","author":"M P\u00fcschel","year":"2002","unstructured":"M.\u00a0P\u00fcschel. Decomposing monomial representations of solvable groups. Journal of Symbolic Computation, 34(6):561\u2013596, 2002.","journal-title":"Journal of Symbolic Computation"},{"key":"9697_CR25","doi-asserted-by":"crossref","unstructured":"D. Rosset, F. Montealegre-Mora, and J.-D. Bancal. Replab: A computational\/numerical approach to representation theory. In Quantum Theory and Symmetries, pages 643\u2013653. Springer, 2021.","DOI":"10.1007\/978-3-030-55777-5_60"},{"key":"9697_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9458-7","volume-title":"Linear Representations of Finite Groups","author":"J-P Serre","year":"1977","unstructured":"J.-P. Serre. Linear Representations of Finite Groups. Springer, 1977."},{"key":"9697_CR27","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4g18","volume-title":"Validated Numerics: A Short Introduction to Rigorous Computations","author":"W Tucker","year":"2011","unstructured":"W. Tucker. Validated Numerics: a Short Introduction to Rigorous Computations. Princeton University Press, Princeton, 2011."},{"key":"9697_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01396059","volume":"34","author":"T Yamamoto","year":"1980","unstructured":"T.\u00a0Yamamoto. Error bounds for computed eigenvalues and eigenvectors. Numerische Mathematik, 34:189\u2013199, 1980.","journal-title":"Numerische Mathematik"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-025-09697-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-025-09697-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-025-09697-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T19:36:51Z","timestamp":1777318611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-025-09697-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["9697"],"URL":"https:\/\/doi.org\/10.1007\/s10208-025-09697-8","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]},"assertion":[{"value":"4 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}