The Asymptotic Number of Geometries
暂无分享，去创建一个
Abstract A simple proof is given that limn−t8(log2 log2gn)/n = 1, where gn denotes the number of distinct combinatorial geometries on n point
[1] H. Crapo,et al. A catalogue of combinatorial geometries , 1973 .
[2] D. J. A. Welsh,et al. On the Number of Combinatorial Geometries , 1971 .
[3] G. Rota,et al. On The Foundations of Combinatorial Theory: Combinatorial Geometries , 1970 .
[4] M. J Piff,et al. An upper bound for the number of matroids , 1973 .