On a theorem of Alladi and Gordon and the Gaussian polynomials (Q1344235): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0097-3165(95)90112-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049804290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition identities and a continued fraction of Ramanujan / 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: Identities in combinatorics. III: Further aspects of ordered set sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bijective proofs of basic hypergeometric series identities / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:50, 23 May 2024

scientific article
Language Label Description Also known as
English
On a theorem of Alladi and Gordon and the Gaussian polynomials
scientific article

    Statements

    On a theorem of Alladi and Gordon and the Gaussian polynomials (English)
    0 references
    5 January 1997
    0 references
    By analyzing a continued fraction of Ramanujan, the reviewer and \textit{B. Gordon} [J. Comb. Theory, Ser. A 63, No. 2, 275-300 (1993; Zbl 0781.05006)] obtained a general partition identity in the form of an equality between three partition functions \(A\), \(B\) and \(C\). This generalized earlier results due to Bressoud and Göllnitz. The reviewer and Gordon established the equality \(A= C\) combinatorially by constructing a bijective, but to prove \(A= B\) they utilized Ramanujan's continued fraction. In this paper, the author constructs an explicit bijection between \(A\) and \(B\). In doing so, not only a strong refinement of the Alladi-Gordon theorem is obtained, but some new insights into certain Gaussian polynomial formulas are revealed.
    0 references
    0 references
    levels
    0 references
    colored parts
    0 references
    partition
    0 references
    Alladi-Gordon theorem
    0 references
    Gaussian polynomial
    0 references
    0 references