Identities in combinatorics. III: Further aspects of ordered set sorting (Q1068087): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Identities in combinatorics. I: On sorting two ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Geometry of Numbers in Elementary Number Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Rogers-Ramanujan bijections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über Orthogonalpolynome, die <i>q</i>‐Differenzengleichungen genügen / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0012-365x(84)90159-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967532874 / rank
 
Normal rank

Latest revision as of 09:24, 30 July 2024

scientific article
Language Label Description Also known as
English
Identities in combinatorics. III: Further aspects of ordered set sorting
scientific article

    Statements

    Identities in combinatorics. III: Further aspects of ordered set sorting (English)
    0 references
    1984
    0 references
    Given two multi-sets of non-negative integers, we define a measure of their common values called the crossing number and then use this concept to provide a combinatorial interpretation of the q-Hahn polynomials and combinatorial proofs of the q-analogs of the Pfaff-Saalschutz summation and the Sheppard transformation.
    0 references
    0 references
    crossing number
    0 references
    q-Hahn polynomials
    0 references
    Pfaff-Saalschutz summation
    0 references
    Sheppard transformation
    0 references
    0 references
    0 references
    0 references