On a conjecture of Andrews. II. (Q4407947)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1944631
Language Label Description Also known as
default for all languages
No label defined
    English
    On a conjecture of Andrews. II.
    scientific article; zbMATH DE number 1944631

      Statements

      2002
      0 references
      partition functions
      0 references
      On a conjecture of Andrews. II. (English)
      0 references
      For an even integer \(\lambda\), let \(A_{\lambda,k,a}(n)\) denote the number of partitons of \(n\) into parts such that no part \(\not\equiv 0\pmod{\lambda+ 1}\) may be repeated and no part is \(\equiv 0\), \(\pm(a- \lambda/2)(\lambda+1)\pmod{2k- \lambda+1}(\lambda+ 1)\). For an odd integer \(\lambda\), let \(A_{\lambda,k,a}(n)\) denote the number of partitions of \(n\) into parts such that no part \(\not\equiv 0\pmod{\lambda+ 1)/2}\) may be repeated, no part is \(\equiv\lambda+ 1\pmod{2\lambda+2}\) and no part is \(\equiv 0\), \(\pm(2a- \lambda)(\lambda+ 1)/2\pmod{2k- \lambda+1}(\lambda+1)\). Let \(B_{\lambda,k,a}(n)\) denote the number of partitions of \(n\) of the form \(b_1+\cdots+ b_s\) with \(b_i\geq b_{i+1}\), no part \(\not\equiv 0\pmod{\lambda+1}\) is repeated, \(b_i- b_{i+k-1}\geq \lambda+1\) with strict inequality if \(\lambda+ 1\) divides \(b_i\), \(f_j+\cdots+ f_{\lambda-j+1}\leq a-j\) for \(1\leq j\leq (\lambda+1)/2\) and \(f_1+\cdots+ f_{\lambda+1}\leq a-1\) where \(f-i\) is the number of appearance of \(i\) in the partition. From the Rogers-Ramanujan-Göllwitz-Gordon-Andrews identities (cf. \(\lambda= 0,1\)) \textit{G. E. Andrews} [Mem. Am. Math. Soc. 152 (1974; Zbl 0296.10010)] conjectured that, for \(\lambda/2< a\leq k<\lambda\), \(B_{\lambda,k,a}(n)= A_{\lambda,k,a}(n)\) if \(n< (k+\lambda- a+1)(k+ \lambda- a)/2+(k- \lambda+1)(\lambda+ 1)\), while \(B_{\lambda,k,a}(n)= A_{\lambda,k,a}(n)+ 1\) when \(n= (k+\lambda- a+1)(k+ \lambda-a)/2+ (k-\lambda+ 1)(\lambda+1)\); and verified his conjecture in certain cases. The case \(k=a\) of Andrews' conjecture was proved by \textit{Padmavathamma} and \textit{T. G. Sudha} [Int. J. Math. Sci. 16, 763--774 (1993; Zbl 0797.11078)]. In the paper under review the authors prove the cases \(k=a+1\) and \(k=a+2\) of the above conjecture. For the entire collection see [Zbl 0997.00018].
      0 references
      0 references
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references