On the Number of Conjugate Classes of Derangements

The number of conjugate classes of derangements of order n is the same as the number h n of the restricted partitions with every portion greater than 1. It is also equal to the number of isotopy classes of 2 × n Latin rectangles. Sometimes the exact value is necessary, while sometimes we need the approximation value. In this paper, a recursion formula of h n will be obtained and also will some elementary approximation formulae with high accuracy for h n be presented. Although we may obtain the value of h n in some computer algebra system, it is still meaningful to find an efficient way to calculate the approximate value, especially in engineering, since most people are familiar with neither programming nor CAS software. This paper is mainly for the readers who need a simple and practical formula to obtain the approximate value (without writing a program) with more accuracy, such as to compute the value in a pocket science calculator without programming function. Some methods used here can also be applied to find the fitting functions for some types of data obtained in experiments.

[1]  Brandt Kronholm.  A Result on Ramanujan-Like Congruence Properties of the Restricted Partition Function p(n, m) Across Both Variables , 2012, Integers.

[2]  D. J. Newman,et al.  A simplified proof of the partition formula. , 1962 .

[3]  A. E. Ingham.  A Tauberian Theorem for Partitions , 1941 .

[4]  K. Thanigasalam.  Congruence Properties of Certain Restricted Partitions , 1974 .

[5]  B. Berndt.  RAMANUJAN'S CONGRUENCES FOR THE PARTITION FUNCTION MODULO 5, 7, AND 11 , 2007 .

[6]  G. Hardy,et al.  Asymptotic formulae in combinatory analysis , 1918 .

[7]  Wen-Wei Li.  Estimation of the Partition Number: After Hardy and Ramanujan , 2016 .

[8]  Rafael Gustavo Jakimczuk.  Restricted partitions , 2004, Int. J. Math. Math. Sci..

[9]  Ronald F. Boisvert,et al.  NIST Handbook of Mathematical Functions , 2010 .

[10]  Douglas S. Stones.  ON THE NUMBER OF LATIN RECTANGLES , 2010, Bulletin of the Australian Mathematical Society.

[11]  Zachary A. Kent,et al.  ℓ-Adic properties of the partition function☆☆☆ , 2012 .

[12]  ON CONGRUENCE PROPERTIES OF CONSECUTIVE VALUES OF P(N,M) , 2007 .

[13]  I. Gessel.  Counting three-line Latin rectangles , 1986 .

[14]  Anne Greenbaum,et al.  NUMERICAL METHODS , 2017 .

[15]  Some restricted partition functions: Congruences modulo 2 , 1970 .

[16]  On congruence properties of p(n, m) , 2005 .

[17]  A. Knecht,et al.  Congruences of Restricted Partition Functions , 2002 .

[18]  G. Hardy,et al.  Asymptotic Formulaæ in Combinatory Analysis , 1918 .

[19]  Qing-Lin Lu,et al.  On a restricted m-ary partition function , 2004, Discret. Math..

[20]  D. J. Newman.  The Evaluation of the Constant in the Formula for the Number of Partitions of n , 1951 .

[21]  Wen-Wei Li.  Approximation of the Partition Number After Hardy and Ramanujan: An Application of Data Fitting Method in Combinatorics , 2016, 1612.05526.

[22]  Maximilian Bayer,et al.  Numerical Analysis Mathematics Of Scientific Computing , 2016 .

[23]  Holden Lee,et al.  $$\ell $$ℓ-Adic properties of partition functions , 2014 .

[24]  George E. Andrews,et al.  Ramanujan’s Unpublished Manuscript on the Partition and Tau Functions , 2001 .

[25]  Generalized congruence properties of the restricted partition function p(n,m) , 2013 .

[26]  Zafer Selcuk Aygin.  Ramanujan's congruences for the partition function , 2009 .

[27]  SOME RESTRICTED PARTITION FUNCTIONS. CONGRUENCES MODULO 11 , 1969 .

[28]  Some Restricted Partition Functions: Congruences Modulo 5 , 1969 .