An implementation of the generalized Lusztig–Shoji algorithm∗
نویسنده
چکیده
Let V be a finite-dimensional complex vector space, and let W ⊂ GL(V ) be a complex reflection group. Let q be an indeterminate. For an irreducible character χ ∈ Irr(W ), let R(χ) denote its fake degree, a polynomial in q. We define R(χ) for reducible characters as well, by extending linearly. Let N∗ be the number of reflections in W , and let Ω = (ωχ,χ′)χ,χ′∈Irr(W ) be the square matrix with entries in Z[q] given by
منابع مشابه
Generalized Green Functions and Unipotent Classes for Finite Reductive Groups, I
The algorithm of computing generalized Green functions of a reductive group G contains some unknown scalars occurring from the Fq-structure of irreducible local systems on unipotent classes of G. In this paper, we determine such scalars in the case where G = SLn with Frobenius map F of split type or non-split type. In the case where F is of non-split type, we use the theory of graded Hecke alge...
متن کاملHardware in Loop of a Generalized Predictive Controller for a Micro Grid DC System of Renewable Energy Sources
In this paper, a hardware in the loop simulation (HIL) is presented. This application is purposed as the first step before a real implementation of a Generalized Predictive Control (GPC) on a micro-grid system located at the Military University Campus in Cajica, Colombia. The designed GPC, looks for keep the battery bank State of Charge (SOC) over the 70% and under the 90%, what ensures the bes...
متن کاملOn the Unipotent Support of Character Sheaves
Let G be a connected reductive group over Fq, where q is large enough and the center of G is connected. We are concerned with Lusztig’s theory of character sheaves, a geometric version of the classical character theory of the finite group G(Fq). We show that under a certain technical condition, the restriction of a character sheaf to its unipotent support (as defined by Lusztig) is either zero ...
متن کاملGeneralized Robinson-Schensted Algorithms
In Part I of this thesis, we locate a (conjecturally complete) set of unitary representations in the admissible dual of U(p, q). In a little more detail, Barbasch and Vogan have used the theory of Kazhdan-Lusztig cells to parametrize the irreducible Harish-Chandra modules with integral infinitesimal character in terms of their annihilators and associated varieties. Vogan has conjectured that th...
متن کاملAn accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کامل