PROBLEMS IN PARTITION THEORY AND RELATED TOPICS.
Abstract
The previous complicated proof by the author of the asymptotic approximation to T sub nq, the number of graphs on n unlabelled nodes with q edges has been shortened and simplified. An almost complete arithmetical theory for H sub n)(1), Euler's rencontre number, the number of permutations of n different objects in which no object remains unmoved, has been developed. The corresponding arithmetical theory and the asymptotic theory for (H sub n)(k), the number of permutations of n objects whose expression as a product of disjoint cycles contains no cycle of length less than k+1, has been studied. The combinatorial structures known as stacks have been further studied. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- May 01, 1970
- Accession Number
- AD0708584
Entities
People
- E. M. Wright
Organizations
- University of Aberdeen