Restricting Unipotent Characters in Finite Symplectic Groups
نویسنده
چکیده
We compute the irreducible constituents of the restrictions of all unipotent characters of the groups Sp4(q) and Sp6(q) and odd q to their maximal parabolic subgroups stabilizing a line. It turns out that these restrictions are multiplicity free. We also obtain general information about the restrictions of Harish-Chandra induced characters.
منابع مشابه
Quadratic Unipotent Blocks in General Linear, Unitary and Symplectic Groups
An irreducible ordinary character of a finite reductive group is called quadratic unipotent if it corresponds under Jordan decomposition to a semisimple element s in a dual group such that s = 1. We prove that there is a bijection between, on the one hand the set of quadratic unipotent characters of GL(n, q) or U(n, q) for all n ≥ 0 and on the other hand, the set of quadratic unipotent characte...
متن کاملTheta functions on covers of symplectic groups
We study the automorphic theta representation $Theta_{2n}^{(r)}$ on the $r$-fold cover of the symplectic group $Sp_{2n}$. This representation is obtained from the residues of Eisenstein series on this group. If $r$ is odd, $nle r
متن کاملSome Observations on Products of Characters of Finite Classical Groups
This is an extended version of the talk given by the first author at the conference. We report on the outcome of some experiments with the decomposition of products of (generalized) characters of some classical groups. In particular some results of the PhD-thesis of Dirk Mattig on the products of unipotent characters of general linear groups are presented and commented. In order to obtain simil...
متن کاملA Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups By Jason Fulman
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of Steinberg’s count of unipotent matrices and generalizations of formulas of Rudvalis and Shinoda.
متن کاملA Probabilistic Approach to Conjugacy Classes in the Finite Symplectic and Orthogonal Groups
Markov chains are used to give a purely probabilistic way of understanding the conjugacy classes of the finite symplectic and orthogonal groups in odd characteristic. As a corollary of these methods one obtains a probabilistic proof of Steinberg’s count of unipotent matrices and generalizations of formulas of Rudvalis and Shinoda.
متن کامل