Strongly positive representations of \(\mathrm{GSpin}_{2n+1}\) and the Jacquet module method (with an appendix ``Strongly positive representations in an exceptional rank-one reducibility case'' by Ivan Matić) (Q2512966)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Strongly positive representations of \(\mathrm{GSpin}_{2n+1}\) and the Jacquet module method (with an appendix ``Strongly positive representations in an exceptional rank-one reducibility case'' by Ivan Matić)
scientific article

    Statements

    Strongly positive representations of \(\mathrm{GSpin}_{2n+1}\) and the Jacquet module method (with an appendix ``Strongly positive representations in an exceptional rank-one reducibility case'' by Ivan Matić) (English)
    0 references
    0 references
    2 February 2015
    0 references
    Let \(F\) be a nonarchimedean local field and \(G_n =\mathrm{GSpin}_{2n+1}\). Set \(\nu = |\det|_F\). An irreducible admissible representation \(\sigma\) of \(G_n\) is called strongly positive if all the exponents \(s_i\) are positive whenever \(\sigma\) appears as a subrepresentation of the induced representation \[ \nu^{s_1} \rho_1 \times \cdots \times \nu^{s_k} \rho_k \rtimes \sigma_{\mathrm{cusp}}, \] where \(s_i\) are real numbers, \(\rho_i\) are supercuspidal unitary representations of \(\mathrm{GL}_{n_i}(F)\) and \(\sigma_{\mathrm{cusp}}\) is a supercuspidal representation of \(G_m\). In this paper, the author obtains a classification of strongly positive representations of \(G_n\), assuming the half-integer conjecture. In addition, he describes the general discrete series representations of \(G_n\) in terms of strongly positive representations. The method of the proof follows the algebraic approach of \textit{I. Matić} [J. Algebra 334, No. 1, 255--274 (2011; Zbl 1254.22010)].
    0 references
    0 references
    discrete series
    0 references
    strongly positive representations
    0 references
    Jacquet modules
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers