A relationship between certain colored generalized Frobenius partitions and ordinary partitions (Q1124625): 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: Generalized Frobenius partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NOTE ON TWO OF RAMANUJAN'S FORMULAE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultane Darstellung zweier ganzen Zahlen als einer Summe von ganzen Zahlen und deren Quadratsumme / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON CERTAIN IDENTITIES DUE TO RAMANUJAN / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan and the congruence properties of partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujans Vermutung über Zerfällungszahlen. / rank
 
Normal rank

Latest revision as of 09:26, 20 June 2024

scientific article
Language Label Description Also known as
English
A relationship between certain colored generalized Frobenius partitions and ordinary partitions
scientific article

    Statements

    A relationship between certain colored generalized Frobenius partitions and ordinary partitions (English)
    0 references
    1989
    0 references
    A generalized Frobenius partition, or F-partition, of an integer n is an array \(\begin{pmatrix} a_ 1&a_ 2&...&a_ r \\ b_ 1&b_ 2&...&b_ r \end{pmatrix}\) where the entries in each row are nonnegative integers, \(a_ 1\geq a_ 2\geq...\geq a_ r\), \(b_ 1\geq b_ 2\geq...\geq b_ r\), and \(n=\sum^{r}_{i=1}(a_ i+b_ i+1).\) In this paper the entries in each row are distinct and are taken from k copies of the nonnegative integers distinguished by color. The entries in each row are ordered according to the rule that \(x_ i<y_ j\) if \(x<y\) or if \(x=y\) and \(i<j\), where i,j are integers in the interval [1,k] indicating the colors of x,y. The number of such F-partitions of n with k colors is denoted by \(c\phi_ k(n)\). The number of F-partitions of n with k colors whose order is k under cyclic permutation of the k colors is \[ \overline{c\phi_ k}(n)=\sum_{d| (n,k)}\mu (d)c\phi_{k/d}(n/d). \] It is proved that \(\overline{c\phi_ 5}(n)=5p(5n-1)\) and \(\overline{c\phi_ 7}(n)=7p(7n-2)\) for any positive integer n and, as a corollary, for \(\alpha\) a positive integer, \[ c\phi_ 5(5^{\alpha - 1}n+(\delta_{\alpha}+1)/5)\equiv 0 (mod 5^{\alpha +1})\quad and\quad c\phi_ 7(7^{\alpha -1}n+(\lambda_{\alpha}+2)/7)\equiv 0 (mod 7^{[(\alpha +4)/2]}), \] where \(\delta_{\alpha}\) and \(\lambda_{\alpha}\) are the reciprocals of 24 modulo \(5^{\alpha}\) and \(7^{\alpha}\), respectively. These results are generalizations of a congruence of Ramanujan for ordinary partitions.
    0 references
    generalized Frobenius partition
    0 references
    F-partition
    0 references
    congruence
    0 references

    Identifiers