Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 257-262 |
Number of pages | 6 |
Journal | Australasian Journal of Combinatorics |
Volume | 28 |
Publication status | Published - Sept 2003 |
Keywords
- generalized patterns
- Hartmanis partitions
- combinatorics
- discrete mathematics