Results 11 to 20 of about 234 (130)

A Pieri rule for Hermitian symmetric pairs I [PDF]

open access: yesPacific Journal of Mathematics, 2004
Let \((G,K)\) be a Hermitian symmetric pair, and let \(\mathfrak g\supset\mathfrak k\) denote the corresponding complexified Lie algebra. Then \(\mathfrak k = \mathbb C H\oplus [\mathfrak k,\mathfrak k]\), where \(\text{ad}\,H\) has the eigenvalues \(-1,0,1\) on \(\mathfrak g\). Let \(\mathfrak g = \mathfrak p^-\oplus\mathfrak k\oplus\mathfrak p^+\) be
Enright, Thomas J.   +2 more
openaire   +2 more sources

Schur Superpolynomials: Combinatorial Definition and Pieri Rule [PDF]

open access: yesSymmetry, Integrability and Geometry: Methods and Applications, 2015
Schur superpolynomials have been introduced recently as limiting cases of the Macdonald superpolynomials. It turns out that there are two natural super-extensions of the Schur polynomials: in the limit $q=t=0$ and $q=t\rightarrow\infty$, corresponding respectively to the Schur superpolynomials and their dual.
Blondeau-Fournier, O., Mathieu, P.
openaire   +3 more sources

An Equivariant Quantum Pieri Rule for the Grassmannian on Cylindric Shapes

open access: yesThe Electronic Journal of Combinatorics, 2022
The quantum cohomology ring of the Grassmannian is determined by the quantum Pieri rule for multiplying by Schubert classes indexed by row or column-shaped partitions. We provide a direct equivariant generalization of Postnikov's quantum Pieri rule for the Grassmannian in terms of cylindric shapes, complementing related work of Gorbounov and Korff in ...
Bertiger, Anna   +3 more
openaire   +4 more sources

Equivariant Pieri Rule for the homology of the affine Grassmannian [PDF]

open access: yesJournal of Algebraic Combinatorics, 2012
20 ...
Lam, Thomas, Shimozono, Mark
openaire   +3 more sources

Pieri Type Rules and GL(2|2) Tensor Products [PDF]

open access: yesAlgebras and Representation Theory, 2020
AbstractWe derive a closed formula for the tensor product of a family of mixed tensors using Deligne’s interpolating category $\underline {Rep}(GL_{0})$ R e p ̲ (
Thorsten Heidersdorf, Rainer Weissauer
openaire   +4 more sources

Bernstein operators for universal characters and symplectic universal characters

open access: yesNuclear Physics B
This paper focuses on the construction of the Bernstein operators for universal characters and symplectic universal characters. By carrying out the action of a series of Bernstein operators on the constant function 1, universal characters and symplectic ...
Denghui Li, Zhaowen Yan
doaj   +1 more source

An Orthosymplectic Pieri Rule

open access: yesThe Electronic Journal of Combinatorics, 2018
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 ...
openaire   +3 more sources

The Pieri Rule for GL n Over Finite Fields [PDF]

open access: yes, 2020
The Pieri rule gives an explicit formula for the decomposition of the tensor product of irreducible representation of the complex general linear group GL(n,C) with a symmetric power of the standard representation on C^n. It is an important and long understood special case of the Littlewood-Richardson rule for decomposing general tensor products of ...
Gurevich, S., Howe, R.
openaire   +3 more sources

A Schur-Like Basis of NSym Defined by a Pieri Rule [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2014
Recent research on the algebra of non-commutative symmetric functions and the dual algebra of quasi-symmetric functions has explored some natural analogues of the Schur basis of the algebra of symmetric functions. We introduce a new basis of the algebra of non-commutative symmetric functions using a right Pieri rule. The commutative image of an element
John Maxwell Campbell   +4 more
openaire   +1 more source

Home - About - Disclaimer - Privacy