Related papers: Generalized Green functions and unipotent classes …
In a previous paper, "Generalized Green functions and unipotent classes for finite reductive groups, I", we have determined certain unknown scalars involved in the algorithm of computing generalized Green functions in the case of SL_n. In…
The algorithm of computing generalized Green functions of a finite reductive group contains some unkonwn scalars occuring from the F_q structure of irreducible local systems on unipotent classes on G. In this paper, we determine such…
In this paper, we formulate the notion of split elements of a unipotent class in a connected reductive group $G$. Generalized Green functions of $G$ can be computed by using Lusztig's algorithm, if split elements exist for any unipotent…
We describe the computation of generalized Green functions and 2-parameter Green functions for finite reductive groups.
We determine the Lusztig restrictions on the space of class functions with a unipotent support on a finite reductive group. In particular we give a simple expression for the Lusztig restrictions of the generalized Green functions and we…
In this paper, we consider the set of r-symbols in a full generality. We construct Hall-Littlewood functions and Kostka functions associated to those r-symbols. We also discuss a multi-parameter version of those functions. We show that…
Based on results of Digne-Michel-Lehrer (2003) we give two formulae for two-variable Green functions attached to Lusztig induction in a finite reductive group. We present applications to explicit computation of these Green functions, to…
The 2-parameter Green functions occur as a crucial ingredient in the character formula for Lusztig induction in finite reductive groups. Still, very little is known about these functions, in particular in the case of groups arsing from…
In our previous paper, Green functions associated to complex reflection groups G(e,1,n) were discussed. It involved a combinatorial approach to the Green functions of classical groups of type B_n or C_n. In this paper, we introduce Green…
Let $G(q)$ be a finite group of Lie type over a field with $q$ elements, where $q$ is a prime power. The Green functions of $G(q)$, as defined by Deligne and Lusztig, are known in \textit{almost} all cases by work of Beynon--Spaltenstein,…
Recent work on the quantization of Maxwell theory has used a non-covariant class of gauge-averaging functionals which include explicitly the effects of the extrinsic-curvature tensor of the boundary, or covariant gauges which, unlike the…
We give a generalisation of the character formula of Deligne--Lusztig representations from the finite field case to the truncated formal power series case. Motivated by this generalisation, we give a definition of Green functions for these…
Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
In this paper, we generalize the categorifical construction of a quantum group and its canonical basis introduced by Lusztig (\cite{Lusztig,Lusztig2}) to the generic form of the whole Ringel-Hall algebra. We clarify the explicit relation…
Recent work by a number of people has shown that complex reflection groups give rise to many representation-theoretic structures (e.g., generic degrees and families of characters), as though they were Weyl groups of algebraic groups.…
Higher Green functions are real-valued functions of two variables on the upper half plane which are bi-invariant under the action of a congruence subgroup, have logarithmic singularity along the diagonal, but instead of the usual equation…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
A method to calculate exact Green's functions on lattices in various dimensions is presented. Expressions in terms of generalized hypergeometric functions in one or more variables are obtained for various examples by relating the resolvent…
The values of the ordinary Green functions are known for almost all groups of Lie type, a long term achievement by various authors. In this note we solve the last open cases, which are for exceptional groups $E_8(q)$ where $q$ is a power of…