Brick tabloids and the connection matrices between bases of symmetric functions (Q1182312): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Foundations of Combinatorial Theory. VII: Symmetric Functions through the Theory of Distribution and Occupancy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial interpretation of the inverse kostka matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monomial symmetric functions and the Frobenius map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947818 / rank
 
Normal rank

Latest revision as of 13:57, 15 May 2024

scientific article
Language Label Description Also known as
English
Brick tabloids and the connection matrices between bases of symmetric functions
scientific article

    Statements

    Brick tabloids and the connection matrices between bases of symmetric functions (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    By showing that the entries of certain transition matrices between several more or less natural bases for spaces of homogeneous symmetric functions satisfy certain recursion relations the authors are able to link them to a new type of combinatorial objects (so called Brick Tabloids) whose numbers satisfy the same recursions. This allows them to give combinatorial proofs of a lot of identities between these transition matrices.
    0 references
    brick tabloids
    0 references
    transition matrices
    0 references
    homogeneous symmetric functions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references