English
Related papers

Related papers: Computing Multiplicities of Lie Group Representati…

200 papers

In this paper we explore fundamental concepts in computational complexity theory and the boundaries of algorithmic decidability. We examine the relationship between complexity classes \textbf{P} and \textbf{NP}, where $L \in \textbf{P}$…

Computational Complexity · Computer Science 2025-12-30 Duaa Abdullah , Jasem Hamoud

We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; indefinite and definite summation of sequences that are…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau

In [Wyser-Yong '13] we introduced polynomial representatives of cohomology classes of orbit closures in the flag variety, for the symmetric pair $(GL_{p+q}, GL_p \times GL_q)$. We present analogous results for the remaining symmetric pairs…

Combinatorics · Mathematics 2017-07-11 Benjamin J. Wyser , Alexander Yong

We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…

Group Theory · Mathematics 2020-06-09 A. S. Detinko , D. L. Flannery , A. Hulpke

We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.…

Computational Complexity · Computer Science 2011-01-10 Peter Buergisser , J. M. Landsberg , Laurent Manivel , Jerzy Weyman

We undertake a detailed study of the sets of multiplicity in a second countable locally compact group $G$ and their operator versions. We establish a symbolic calculus for normal completely bounded maps from the space $\mathcal{B}(L^2(G))$…

Operator Algebras · Mathematics 2014-01-14 Victor S. Shulman , Ivan G. Todorov , Lyudmila Turowska

Kronecker coefficients encode the tensor products of complex irreducible representations of symmetric groups. Their stability properties have been considered recently by several authors (Vallejo, Pak and Panova, Stembridge). We describe a…

Representation Theory · Mathematics 2014-11-14 Laurent Manivel

The purpose of this paper is to show that the multiplicities of a discrete series representation relatively to a compact subgroup can be "computed" geometrically, in the way predicted by the "qantization commutes with reduction" principle…

Representation Theory · Mathematics 2008-12-02 Paul-Emile Paradan

In this paper, we introduce geometric multiplicities, which are positive varieties with potential fibered over the Cartan subgroup $H$ of a reductive group $G$. They form a monoidal category and we construct a monoidal functor from this…

Representation Theory · Mathematics 2019-09-02 Arkady Berenstein , Yanpeng Li

The complexity of a homogeneous space $G/H$ under a reductive group $G$ is by definition the codimension of generic orbits in $G/H$ of a Borel subgroup $B\subseteq G$. We give a representation-theoretic interpretation of this number as the…

Algebraic Geometry · Mathematics 2007-05-23 Dmitri A. Timashev

Let G be a Lie group, $g = Lie(G)$ - its Lie algebra, $g*$ - the dual vector space and $\widehat G$ - the set of equivalence classes of unitary irreducible representations of $G$. The orbit method [1] establishes a correspondence between…

Representation Theory · Mathematics 2025-07-08 Dmitry Fuchs , Alexandre Kirillov

According to Kumar's recent surprising result (ToCT'20), a small border Waring rank implies that the polynomial can be approximated as a sum of a constant and a small product of linear polynomials. We prove the converse of Kumar's result…

Computational Complexity · Computer Science 2025-05-29 Pranjal Dutta , Fulvio Gesmundo , Christian Ikenmeyer , Gorav Jindal , Vladimir Lysikov

In an earlier paper of Cadek, Vokrinek, Wagner, and the present authors, we investigated an algorithmic problem in computational algebraic topology, namely, the computation of all possible homotopy classes of maps between two topological…

Computational Geometry · Computer Science 2013-05-14 Marek Krcal , Jiri Matousek , Francis Sergeraert

For any finite group $G$ and any prime $p$ one can ask which ordinary irreducible representations remain irreducible in characteristic $p$. We answer this question for $p=2$ when $G$ is a proper double cover of the symmetric group. Our…

Representation Theory · Mathematics 2024-01-17 Matthew Fayers

We develop a probabilistic algorithm of Kronecker type for computing a Kronecker representation of a zero-dimensional linear section of an algebraic variety $V$ defined over a perfect field $k$. The variety $V$ is the Zariski closure of the…

Algebraic Geometry · Mathematics 2025-12-18 Nardo Giménez , Joos Heintz , Guillermo Matera , Luis Miguel Pardo , Mariana Pérez , Melina Privitelli

In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…

Representation Theory · Mathematics 2010-12-21 Pierre-Loïc Méliot

We present a finite algorithm for computing the set of irreducible unitary representations of a real reductive group G. The Langlands classification, as formulated by Knapp and Zuckerman, exhibits any representation with an invariant…

Representation Theory · Mathematics 2017-10-16 Jeffrey Adams , Marc van Leeuwen , Peter Trapa , David A. Vogan

Lie group theory states that knowledge of a $m$-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by $m$ the number of equation. We apply this principle by finding dilatations and…

Symbolic Computation · Computer Science 2016-08-16 Évelyne Hubert , Alexandre Sedoglavic

The Kronecker coefficient g_{\lambda \mu \nu} is the multiplicity of the GL(V)\times GL(W)-irreducible V_\lambda \otimes W_\mu in the restriction of the GL(X)-irreducible X_\nu via the natural map GL(V)\times GL(W) \to GL(V \otimes W),…

Computational Complexity · Computer Science 2013-06-10 Jonah Blasiak , Ketan D. Mulmuley , Milind Sohoni

Quantum invariants in low dimensional topology offer a wide variety of valuable invariants of knots and 3-manifolds, presented by explicit formulas that are readily computable. Their computational complexity has been actively studied and is…

Geometric Topology · Mathematics 2025-06-27 Henrique Ennes , Clément Maria