Algorithms for computing characters for symmetric spaces
From MaRDI portal
Publication:2464064
Recommendations
Cites work
- scientific article; zbMATH DE number 3929184 (Why is no real title available?)
- scientific article; zbMATH DE number 3747331 (Why is no real title available?)
- scientific article; zbMATH DE number 3758599 (Why is no real title available?)
- scientific article; zbMATH DE number 3508744 (Why is no real title available?)
- Algebraic groups with a commuting pair of involutions and semisimple symmetric spaces
- Algorithms for computing characters for symmetric spaces
- Complements à l'article: Groupes reductifs
- Introduction to Lie Algebras and Representation Theory
- Irreducible characters of semisimple Lie groups. III: Proof of Kazhdan-Lusztig conjecture in the integral case
- Linear algebraic groups.
- Singularities of closures of K-orbits on flag manifolds
Cited in
(11)- Algorithms for twisted involutions in Weyl groups.
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- Computing characteristic polynomials of hyperplane arrangements with symmetries
- Algorithms for computing characters for symmetric spaces
- Algorithms for the character theory of the symmetric group
- Computing the fine structure of real reductive symmetric spaces
- An algorithm for Berenstein-Kazhdan decoration functions and trails for minuscule representations
- Implementation of algorithms for computing characters for symmetric spaces
- Algorithms for Computations in Local Symmetric Spaces
- Using signed permutations to represent Weyl group elements of a symmetric space.
- An algorithm for computing Schur indices of characters
This page was built for publication: Algorithms for computing characters for symmetric spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2464064)