An Orthosymplectic Pieri Rule

The classical Pieri formula gives a combinatorial rule for decomposing the product of a Schur function and a complete homogeneous symmetric polynomial as a linear combination of Schur functions with integer coefficients. We give a Pieri rule for describing the product of an orthosymplectic character and an orthosymplectic character arising from a one-row partition. We establish that the orthosymplectic Pieri rule coincides with Sundaram's Pieri rule for symplectic characters and that orthosymplectic characters and symplectic characters obey the same product rule.

INTERVAL STRUCTURE OF THE PIERI FORMULA FOR GROTHENDIECK POLYNOMIALS

We give a combinatorial interpretation of a Pieri formula for double Grothendieck polynomials in terms of an interval of the Bruhat order. Another description had been given by Lenart and Postnikov in terms of chain enumerations. We use Lascoux's interpretation of a product of Grothendieck polynomials as a product of two kinds of generators of the 0-Hecke algebra, or sorting operators. In this way, we obtain a direct proof of the result of Lenart and Postnikov and then prove that the set of permutations occurring in the result is actually an interval of the Bruhat order.

The Torsion Free Pieri Formula

Central to the study of simple infinite dimensional g𝓵(n, C)-modules having finite dimensional weight spaces are the torsion free modules. All degree 1 torsion free modules are known. Torsion free modules of arbitrary degree can be constructed by tensoring torsion free modules of degree 1 with finite dimensional simple modules. In this paper, the central characters of such a tensor product module are shown to be given by a Pieri-like formula, complete reducibility is established when these central characters are distinct and an example is presented illustrating the existence of a nonsimple indecomposable submodule when these characters are not distinct.