On the number of conjugate classes of derangements
Summary: 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\times 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.
- The Number of Conjugacy Classes
- scientific article; zbMATH DE number 5019378
- Publication:4206930
- On the combinatorics of derangements and related permutations
- The \(r\)-derangement numbers
- On the number of conjugacy classes in a finite group
- On the number of conjugacy classes of a finite group
- scientific article; zbMATH DE number 800259
- Conjugacy classes of derangements in finite transitive groups
- On the group order and the number of conjugacy classes
- \(\ell\)-adic properties of partition functions
- \(\ell\)-adic properties of the partition function. Appendix A by Nick Ramsey
- A Note on Congruence Properties of Certain Restricted Partitions
- A result on Ramanujan-like congruence properties of the restricted partition function p(n,m) across both variables
- A simplified proof of the partition formula
- A Tauberian theorem for partitions
- An elementary derivation of the asymptotics of partition functions
- Congruence Properties of Certain Restricted Partitions
- Generalized congruence properties of the restricted partition function \(p(n,m)\)
- scientific article; zbMATH DE number 5950695 (Why is no real title available?)
- scientific article; zbMATH DE number 3140514 (Why is no real title available?)
- NIST handbook of mathematical functions
- Numerical methods. Design, analysis, and computer implementation of algorithms.
- On an elementary proof of some asymptotic formulas in the theory of partitions
- On congruence properties of consecutive values of \(p(n,m)\)
- On congruence properties of 𝑝(𝑛,𝑚)
- RAMANUJAN'S CONGRUENCES FOR THE PARTITION FUNCTION MODULO 5, 7, AND 11
- Restricted partitions: elementary methods
- Some restricted partition functions: Congruences modulo 3
- Some Restricted Partition Functions: Congruences Modulo 5
- Some Restricted Partition Functions: Congruences Modulo 7
- The Evaluation of the Constant in the Formula for the Number of Partitions of n
- Weighted restricted partitions
This page was built for publication: On the number of conjugate classes of derangements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051668)
