Mathematics – Combinatorics
Scientific paper
2004-11-24
Mathematics
Combinatorics
10 pages; revised proofs and corrected typos
Scientific paper
In this paper we highlight some enumerative results concerning matroids of low rank and prove the tail-ends of various sequences involving the number of matroids on a finite set to be log-convex. We give a recursion for a new, slightly improved, lower bound on the number of rank-$r$ matroids on $n$ elements when $n=2^m-1$. We also prove an adjacent result showing the point-lines-planes conjecture to be true if and only if it is true for a special subcollection of matroids. Two new tables are also presented, giving the number of paving matroids on at most eight elements.
No associations
LandOfFree
The number of matroids on a finite set does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with The number of matroids on a finite set, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The number of matroids on a finite set will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-577236