Mohajan, Haradhan
(2015):
*Generalization of Euler and Ramanujan’s Partition Function.*
Published in: Asian Journal of A pplied Science and Engineering
, Vol. 4, No. 3
(12 November 2015): pp. 167-190.

Preview |
PDF
MPRA_paper_83049.pdf Download (748kB) | Preview |

## Abstract

The theory of partitions has interested some of the best minds since the 18th century. In 1742, Leonhard Euler established the generating function of P(n). Godfrey Harold Hardy said that Srinivasa Ramanujan was the first, and up to now the only, mathematician to discover any such properties of P(n). In 1981, S. Barnard and J.M. Child stated that the different types of partitions of n in symbolic form. In this paper, different types of partitions of n are also explained with symbolic form. In 1952, E. Grosswald quoted that the linear Diophantine equation has distinct solutions; the set of solution is the number of partitions of n. This paper proves theorem 1 with the help of certain restrictions. In 1965, Godfrey Harold Hardy and E. M. Wright stated that the ‘Convergence Theorem’ converges inside the unit circle. Theorem 2 has been proved here with easier mathematical calculations. In 1853, British mathematician Norman Macleod Ferrers explained a partition graphically by an array of dots or nodes. In this paper, graphic representation of partitions, conjugate partitions and self-conjugate partitions are described with the help of examples.

Item Type: | MPRA Paper |
---|---|

Original Title: | Generalization of Euler and Ramanujan’s Partition Function |

English Title: | Generalization of Euler and Ramanujan’s Partition Function |

Language: | English |

Keywords: | Ferrers and Young diagram, generating function, partitions, Ramanujan |

Subjects: | C - Mathematical and Quantitative Methods > C3 - Multiple or Simultaneous Equation Models ; Multiple Variables C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling C - Mathematical and Quantitative Methods > C6 - Mathematical Methods ; Programming Models ; Mathematical and Simulation Modeling > C60 - General |

Item ID: | 83049 |

Depositing User: | Haradhan Kumar Mohajan |

Date Deposited: | 25 Dec 2017 06:02 |

Last Modified: | 27 Sep 2019 03:12 |

References: | Ahlgren, S. and Ono, K. (2001), Addition and Counting: The Arithmetic of Partitions, Notices of the American Mathematical Society (AMS), 48(9): 978– 984. Andrews, G.E. (1967), On Schur’s Second Partition Theorem, Glasgow Mathematical Journal, 8: 127–132. Andrews, G.E. (1971), Number Theory, W.B. Saunders Company, Philadelphia, Dover Edition. Andrews, G.E. (1976), The Theory of Partitions, Cambridge University Press. Andrews, G.E. (1979), An Introduction to Ramanujan’s Lost Notebook, American Mathematical Monthly, 86 (2): 89–108. Barnard, S. and Child, J.M. (1967), Higher Algebra, MacMillan & Company, London. Burn, R.P. (1964), A Pathway into Number Theory, 2nd Ed., Cambridge University Press, Cambridge. Das, S. and Mohajan, H.K. (2014a), The Number of Vector Partitions of n (Counted According to the Weight) with Crank m, International Journal of Reciprocal Symmetry & Theoretical Physics, 1(2): 91–105. Das, S. and Mohajan, H.K. (2014b), Generating Functions for and , American Review of Mathematics and Statistics, 2(1): 33–35. Das, S. and Mohajan, H.K. (2015), Recent Development of Euler and Ramanujan’s Partition and Generating Functions, Book to Appear. Doubilet, P.; Rota, G.-C.; Stanley, R. (1972), On the Foundations of Combinatorial Theory VI: The Generating Function, Proceedings of the Sixth Berkeley Symposium on Mathematical Statistics and Probability, 2: 267–318. Griffin, H. (1971), Elementary Theory of Numbers, McGraw-Hill Book Company Inc. Grosswald, E. (1952), The Theory of Numbers, University of Pennsylvania. Hardy, G.H. and Ramanujan, S. (1917a), Une Formule Asymptotique Pour le Nombre des Partitions de n [Comptes Rendus, 2 Jan. 1917] (French) [An Asymptotic Formula for the Number of Partitions of n] Collected Papers of Srinivasa Ramanujan, Pages 239–241, American Mathematical Society (AMS) Chelsea Publishing, Providence, RI, 2000. Hardy, G.H. and Ramanujan, S. (1917b), Asymptotic Formulae in Combinatory Analysis [Proc. London Math. Soc. (2) 16 (1917), Records for 1 March 1917], Collected Papers of Srinivasa Ramanujan, 244, American Mathematical Society (AMS) Chelsea Publishing, Providence, RI, 2000. Hardy G.H. and Wright, E.M. (1965), Introduction to the Theory of Numbers, 4th Ed., Clarendon Press, Oxford. Johansson, F. (2012), Efficient Implementation of the Hardy-Ramanujan-Rademacher Formula, LMS Journal of Computation and Mathematics, 15: 341–359. Johansson, F. (2014), "New partition function record: p(1020) computed", March 2, 2014. Josuat-Vergès, M. (2010), Bijections between Pattern-avoiding Fillings of Young Diagrams, Journal of Combinatorial Theory, Series A 117(8): 1218–1230, MacMahon, P.A. (2005), Combinatory Analysis, Ann Arbor, Michigan: University of Michigan Library. Niven, I.; Zuckerman, H.S. and Montgomery, H.L. (1991), An Introduction to the Theory of Numbers, 5th Ed., John Wiley & Sons Inc., New York. Ono, K. (2009), Unearthing the Visions of a Master: Harmonic Maass Forms and Number Theory, Harvard-MIT Current Developments in Mathematics Conference, Int. Press, Somerville, MA, 347–454. Rademacher, H. (1943), On the Expansion of the Partition Function in a Series, The Annals of Mathematics, 44(2): 416–422. Rademacher, H. (1973), Topics in Analytic Number Theory, Die Grundlehren der Mathematischen Wissenschaften, Band 169, Springer Verlag New York-Heidelberg. Sylvester, J.J. (1882), A Constructive Theory of Partitions, Arranged in Three Acts, an Interact and an Exodion, The American Journal of Mathematics, 5: 251–330. Tattersall, J.J. (1999), Elementary Number Theory in Nine Chapters, Cambridge University Press, New York. Wilf, H.S. (1994), Generatingfunctionology (2nd Ed.), Boston, MA: Academic Press. |

URI: | https://mpra.ub.uni-muenchen.de/id/eprint/83049 |