Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ Discrete Mathematics...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Episciences
Article . 2013
Data sources: Episciences
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
Hal
Conference object . 2013
Data sources: Hal
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
versions View all 5 versions
addClaim

Schubert polynomials and $k$-Schur functions (Extended abstract)

Authors: Carolina Benedetti; Nantel Bergeron;

Schubert polynomials and $k$-Schur functions (Extended abstract)

Abstract

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function can be understood from the multiplication in the space of dual $k$-Schur functions. Using earlier work by the second author, we encode both problems by means of quasisymmetric functions. On the Schubert vs. Schur side, we study the $r$-Bruhat order given by Bergeron-Sottile, along with certain operators associated to this order. On the other side, we connect this poset with a graph on dual $k$-Schur functions given by studying the affine grassmannian order of Lam-Lapointe-Morse-Shimozono. Also, we define operators associated to the graph on dual $k$-Schur functions which are analogous to the ones given for the Schubert vs. Schur problem. Le but principal de cet article est de montrer que la multiplication d’un polynôme de Schubert de type fini $A$ par une fonction de Schur peut être comprise à partir de la multiplication dans l’espace dual des fonctions $k$-Schur. Les travaux antérieurs par le second auteur, nous permet de coder ces deux problèmes au moyen de fonctions quasi-symétriques. Du côté Schubert vs Schur, nous étudions l’ordre partiel $r$-Bruhat donné par Bergeron-Sottile, ainsi que certains opérateurs associés à cet ordre. Nous donnons une relation entre l’ordre $r$-Bruhat et le graphe de Bruhat sur les fonctions $k$-Schur duales données par l’étude de l’ordre affine grassmannienne de Lam-Lapointe-Morse-Shimozono. En outre, nous définissons des opérateurs associés a ce graphe qui sont analogues à ceux donnés pour le problème Schubert vs Schur.

Related Organizations
Keywords

strong order., [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Schubert polynomials, [info.info-dm]computer science [cs]/discrete mathematics [cs.dm], QA1-939, affine grassmannian, r-Bruhat order, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], k-schur functions, schubert polynomials, r-bruhat order, Mathematics, k-Schur functions

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Average
Average
Average
Green
Published in a Diamond OA journal