Acta Mathematica Hungarica

, Volume 149, Issue 2, pp 375–395 | Cite as

On a phenomenon of Turán concerning the summands of partitions

Article
  • 60 Downloads

Abstract

Turán [12] proved that for almost all pairs of partitions of an integer, the proportion of common parts is very high, that is greater than \({\frac{1}{2} - \varepsilon}\) with \({\varepsilon > 0}\) arbitrarily small. In this paper we prove that this surprising phenomenon persists when we look only at the summands in a fixed arithmetic progression.

Mathematics Subject Classification

primary 11P82 secondary 05A17 11P83 

Key words and phrases

pair of partitions common part in residue classes 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dartyge C., Sárközy A.: Arithmetic properties of summands of partitions. Ramanujan J. 8, 199–215 (2004)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Dartyge C., Sárközy A.: Arithmetic properties of summands of partitions II. Ramanujan J. 10, 383–394 (2005)MathSciNetCrossRefMATHGoogle Scholar
  3. 3.
    Dartyge C., Sárközy A., Szalay M.: On the distribution of the summands of partitions in residue classes. Acta Math. Hungar. 109, 215–237 (2005)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Dartyge C., Szalay M.: Dominant residue classes concerning the summands of partitions. Funct. Approx. Comment. Math. 37, 65–96 (2007)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Dartyge C., Szalay M.: Local distribution of the parts of unequal partitions in arithmetic progressions I. Publ. Math. Debrecen 79, 379–393 (2011)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Dartyge C., Szalay M.: Local distribution of the parts of unequal partitions in arithmetic progressions II. Publ. Math. Debrecen 81, 453–486 (2012)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Erdős P., Lehner J.: The distribution of the number of summands in the partitions of a positive integer. Duke Math. J. 8, 335–345 (1941)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    P. Erdőos and M. Szalay, On the statistical theory of partitions, in: Coll. Math. Soc. János Bolyai, 34, Topics in Classical Number Theory (Budapest 1981), North-Holland (Amsterdam, 1984), pp. 397–450.Google Scholar
  9. 9.
    Hardy G. H., Ramanujan S.: Asymptotic formulae in combinatory analysis. Proc. London Math. Soc. 17, 75–115 (1918)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th edition, Clarendon Press (Oxford, 1978).Google Scholar
  11. 11.
    Meinardus G.: Asymptotische Aussagen über Partitionen. Math. Z. 59, 388–398 (1954)MathSciNetCrossRefMATHGoogle Scholar
  12. 12.
    P. Turán, On some connections between combinatorics and group theory, in: Coll. Math. Soc. János Bolyai, 4, Combinatorial Theory and its Applications (Balatonfüred, 1969), North-Holland (Amsterdam, 1970), pp. 1055–1082.Google Scholar
  13. 13.
    P. Turán, Combinatorics, partitions, group theory, in: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Accad. Naz. Lincei (Rome, 1976), pp. 181–200.Google Scholar
  14. 14.
    P. Turán, On some phenomena in the theory of partitions, Journées Arithmétiques de Bordeaux (Conf., Univ. Bordeaux, Bordeaux, 1974), Astérisque, Nos. 24-25, Soc. Math. France (Paris, 1975), pp. 311-319.Google Scholar

Copyright information

© Akadémiai Kiadó, Budapest, Hungary 2016

Authors and Affiliations

  1. 1.Institut Élie CartanUniversité de LorraineVandœuvre CedexFrance
  2. 2.Department of Algebra and Number TheoryEötvös Loránd UniversityBudapestHungary

Personalised recommendations