# The Computational Complexity to Evaluate Representations of General Linear Groups

@article{Brgisser2000TheCC,
title={The Computational Complexity to Evaluate Representations of General Linear Groups},
author={Peter B{\"u}rgisser},
journal={SIAM J. Comput.},
year={2000},
volume={30},
pages={1010-1022}
}
• Peter Bürgisser
• Published 1 May 2000
• Mathematics, Computer Science
• SIAM J. Comput.
We describe a fast algorithm to evaluate irreducible matrix representations of complex general linear groups ${\rm GL}_{m}$ with respect to a symmetry adapted basis (Gelfand--Tsetlin basis). This is complemented by a lower bound, which shows that our algorithm is optimal up to a factor $m^2$ with regard to nonscalar complexity. Our algorithm can be used for the fast evaluation of special functions: for instance, we obtain an $O(\ell\log\ell)$ algorithm to evaluate all associated Legendre… Expand

#### Figures and Topics from this paper

Fast quantum algorithms for approximating some irreducible representations of groups
We consider the quantum complexity of estimating matrix elements of unitary irreducible representations of groups. For several finite groups including the symmetric group, quantum Fourier transformsExpand
On the Stability of Fast Polynomial Arithmetic
Operations on univariate dense polynomials—multiplication, division with remainder, multipoint evaluation—constitute central primitives entering as build-up blocks into many higher applications andExpand
The Computational Complexity of Immanants
It is shown that the evaluation of immanants corresponding to hook diagrams or rectangular diagrams of polynomially growing width is both #P-complete and VNP-complete. Expand
Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials
This thesis tries to answer the question why specific polynomials have no small suspected arithmetic circuits and introduces a new framework for arithmetic circuits, similar to fixed parameter tractability in the boolean setting. Expand
Noncommutative Valiant's Classes
• Computer Science, Mathematics
• ACM Trans. Comput. Theory
• 2016
It is shown that Dyck polynomials are complete for the class VPnc under ≤ abp reductions, to the best of the authors' knowledge, these are the first natural polynomial families shown to be VPnc-complete. Expand
The Complexity of the Fermionant and Immanants of Constant Width [Note]
• Mathematics, Computer Science
• Theory Comput.
• 2013
It is shown that computing $\Ferm_k$ is P-hard under Turing reductions for any constant $k > 2, and is$\oplusP-hard for $k=2$, even for the adjacency matrices of planar graphs, and there are randomized polynomial-time algorithms for NP-complete problems. Expand
A full complexity dichotomy for immanant families
This paper shows that the assumption FPT≠ #W[1] from parameterized complexity rules out polynomial-time algorithms for Imm(Κ) for any computationally reasonable family of partitions Λ with b(Λ)=∞, and gives an analogous result in algebraic complexity under the assumption VFPT≠ VW[1]. Expand
Report on "Mathematical Aspects of P vs. NP and its Variants."
• Computer Science, Mathematics
• ArXiv
• 2012
The main themes are representation theory and geometry in the Mulmuley-Sohoni Geometric Complexity Theory Program, and number theory and other ideas in the Blum-Shub-Smale model. Expand
Towards a Theory of Non-Commutative Optimization: Geodesic 1st and 2nd Order Methods for Moment Maps and Polytopes
• Mathematics, Computer Science
• 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS)
• 2019
This paper initiates a systematic development of a theory of non-commutative optimization, a setting which greatly extends ordinary (Euclidean) convex optimization, and develops two general methods in the geodesic setting, a first order and a second order method which respectively receive first and second order information on the "derivatives" of the function to be optimized. Expand
Immanants, Tensor Network States and the Geometric Complexity Theory Program
IMMANANTS, TENSOR NETWORK STATES AND THE GEOMETRIC COMPLEXITY THEORY PROGRAM. (Aug 2012) Ke Ye, B.S., Sichuan University Chair of Advisory Committee: J.M. Landsberg We study the geometry ofExpand

#### References

SHOWING 1-10 OF 27 REFERENCES
The evaluation of irreducible polynomial representations of the general linear groups and of the unitary groups over fields of characteristic 0
• Mathematics
• 1987
We describe an efficient method for the computer evaluation of the ordinary irreducible polynomial representations of general linear groups using an integral form of the ordinary irreducibleExpand
The Complexity of Immanants
For studying the complexity to evaluate single entries of invariant matrices of GL m , we investigate the complexity of immanants. These matrix functions contain the permanent and determinant asExpand
The Computational Complexity of Immanants
It is shown that the evaluation of immanants corresponding to hook diagrams or rectangular diagrams of polynomially growing width is both #P-complete and VNP-complete. Expand
Fast Generalized Fourier Transforms
• M. Clausen
• Computer Science, Mathematics
• Theor. Comput. Sci.
• 1989
A trivial upper bound for the linear complexity of a suitable Wedderburn transform corresponding to G is improved by showing that Ls(G) is smaller than min {(s( T )−l( T ))·|G |+7 q( T) ·|G| 3 2 , where the minimum is taken over all towers. Expand
Completeness classes in algebra
The aim of this paper is to demonstrate that for both algebraic and combinatorial problems this phenomenon exists in a form that is purely algebraic in both of the respects (A) and (B). Expand
Completeness and Reduction in Algebraic Complexity Theory
• Peter Bürgisser
• Mathematics, Computer Science
• Algorithms and computation in mathematics
• 2000
The structure of Valiant's Algebraic Model of NP-Completeness is illustrated with some Complete Families of Polynomials and the Complexity of Immanants. Expand
Algebraic complexity theory
• Computer Science
• Grundlehren der mathematischen Wissenschaften
• 1997
This is the first book to present an up-to-date and self-contained account of Algebraic Complexity Theory that is both comprehensive and unified. Requiring of the reader only some basic algebra andExpand
Representation of Lie groups and special functions
• Mathematics
• 1991
At first only elementary functions were studied in mathematical analysis. Then new functions were introduced to evaluate integrals. They were named special functions: integral sine, logarithms, theExpand
Generalized FFTS - A Survey of Some Recent Results
• Mathematics
• 1995
In this paper we survey some recent work directed towards generalizing the fast Fourier transform (FFT). We work primarily from the point of view of group representation theory. In this setting theExpand
Representations of the Heisenberg Group and Special Functions
• Mathematics
• 1993
The maximal nilpotent group N in U(n − 1,1) consists of matrices (6) of Section 11.1.1. Replace in these matrices a by −2c.