Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. A Littlewood-Richard ...
Conference paper

A Littlewood-Richardson type rule for row-strict quasisymmetric Schur functions

Jeffrey Ferreira (1)
(1) Department of Mathematics [Univ California Davis]
Download article
Open on HAL
Imported on
January 31, 2017
Published on
December 31, 2010
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AO, 23rd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2011)
Proceedings
DOI
10.46298/dmtcs.2914
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
0636297
EMSW21-VIGRE: Focus on Mathematics
Indicators
619
Views
529
Downloads

A Littlewood-Richardson type rule for row-strict quasisymmetric Schur functions

Jeffrey Ferreira (1)
(1) Department of Mathematics [Univ California Davis]
Abstract
English
We establish several properties of an algorithm defined by Mason and Remmel (2010) which inserts a positive integer into a row-strict composition tableau. These properties lead to a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions.
French
Nous établissons plusieurs propriétés d'un algorithme défini par Mason et Remmel (2010), qui insère un entier positif dans un tableau dont la forme est une composition, avec ordre strict sur les lignes (row-strict). Ces propriétés conduisent à une règle de type Littlewood-Richardson pour étendre le produit d'une fonction de Schur quasi-symétrique "row-strict'' et d'une fonction de Schur symétrique en termes de fonctions de Schur quasi-symétriques "row-strict''.
Keywords
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Littlewood-Richardson rule
  • quasisymmetric function
  • Schur function
Cited by

Source: OpenCitations

  • Row-Strict Quasisymmetric Schur Functions

    Annals of Combinatorics

    Authors : Sarah Mason ORCID, Jeffrey Remmel

    Journal reference : Volume 18, 2013, pp. 127-148

    DOI : 10.1007/s00026-013-0216-3
Preview
Loading PDF preview...