The number of matroids on a finite set

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-577236

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.