7,437 research outputs found

    Restriction of odd degree characters and natural correspondences

    Full text link
    Let qq be an odd prime power, n>1n > 1, and let PP denote a maximal parabolic subgroup of GLn(q)GL_n(q) with Levi subgroup GLn−1(q)×GL1(q)GL_{n-1}(q) \times GL_1(q). We restrict the odd-degree irreducible characters of GLn(q)GL_n(q) to PP to discover a natural correspondence of characters, both for GLn(q)GL_n(q) and SLn(q)SL_n(q). A similar result is established for certain finite groups with self-normalizing Sylow pp-subgroups. We also construct a canonical bijection between the odd-degree irreducible characters of SnS_n and those of MM, where MM is any maximal subgroup of SnS_n of odd index; as well as between the odd-degree irreducible characters of G=GLn(q)G = GL_n(q) or GUn(q)GU_n(q) with qq odd and those of NG(P)N_{G}(P), where PP is a Sylow 22-subgroup of GG. Since our bijections commute with the action of the absolute Galois group over the rationals, we conclude that the fields of values of character correspondents are the same. We use this to answer some questions of R. Gow

    Kronecker products and the RSK correspondence

    Full text link
    The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that realizes combinatorially this identity. As a consequence we obtain an algorithm that to each minimal matrix associates a minimal component, with respect to the dominance order, in a Kronecker product, and a combinatorial description of the corresponding Kronecker coefficient in terms of minimal matrices and tableau insertion. Our bijection follows from a generalization of the dual RSK correspondence to 3-dimensional binary matrices, which we state and prove. With the same tools we also obtain a generalization of the RSK correspondence to 3-dimensional integer matrices
    • …
    corecore