Dukes, W. M. B. (2003) Bounds on the number of generalized partitions and some applications. Australasian Journal of Combinatorics, 28. pp. 257-262. ISSN 1034-4942Full text not available in this repository. (Request a copy from the Strathclyde author)
We present bounds concerning the number of Hartmanis partitions of a finite set. An application of these inequalities improves the known asymptotic lower bound on the number of linear spaces on n points. We also present an upper bound for a certain class of these partitions which bounds the number of Steiner triple and quadruple systems.
|Keywords:||generalized patterns, Hartmanis partitions, combinatorics, discrete mathematics, Electronic computers. Computer science, Discrete Mathematics and Combinatorics|
|Subjects:||Science > Mathematics > Electronic computers. Computer science|
|Department:||Faculty of Science > Computer and Information Sciences|
|Depositing user:||Pure Administrator|
|Date Deposited:||10 Dec 2014 11:57|
|Last modified:||07 Jan 2017 04:39|